./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-01 16:20:57,331 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 16:20:57,332 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 16:20:57,353 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 16:20:57,353 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 16:20:57,354 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 16:20:57,355 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 16:20:57,356 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 16:20:57,357 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 16:20:57,358 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 16:20:57,358 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 16:20:57,359 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 16:20:57,359 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 16:20:57,360 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 16:20:57,361 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 16:20:57,362 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 16:20:57,363 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 16:20:57,363 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 16:20:57,364 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 16:20:57,366 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 16:20:57,367 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 16:20:57,368 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 16:20:57,368 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 16:20:57,369 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 16:20:57,371 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 16:20:57,372 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 16:20:57,372 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 16:20:57,373 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 16:20:57,373 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 16:20:57,374 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 16:20:57,374 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 16:20:57,374 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 16:20:57,375 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 16:20:57,375 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 16:20:57,376 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 16:20:57,376 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 16:20:57,377 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 16:20:57,377 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 16:20:57,377 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 16:20:57,377 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 16:20:57,378 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 16:20:57,379 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 16:20:57,394 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 16:20:57,394 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 16:20:57,394 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 16:20:57,394 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 16:20:57,395 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 16:20:57,395 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 16:20:57,395 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 16:20:57,396 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 16:20:57,396 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 16:20:57,397 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 16:20:57,397 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:20:57,398 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 16:20:57,398 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 16:20:57,399 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 16:20:57,399 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 16:20:57,399 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 16:20:57,399 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 16:20:57,399 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
[2023-11-01 16:20:57,609 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 16:20:57,629 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 16:20:57,631 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 16:20:57,632 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 16:20:57,632 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 16:20:57,633 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-11-01 16:20:58,614 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 16:20:58,879 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 16:20:58,880 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-11-01 16:20:58,891 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6c4651ddf/9d073b51dda84bcf9b42403cc2258565/FLAG6f1d964f7
[2023-11-01 16:20:59,196 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6c4651ddf/9d073b51dda84bcf9b42403cc2258565
[2023-11-01 16:20:59,198 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 16:20:59,199 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 16:20:59,200 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 16:20:59,200 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 16:20:59,203 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 16:20:59,204 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,204 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fe034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59, skipping insertion in model container
[2023-11-01 16:20:59,204 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,210 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 16:20:59,243 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 16:20:59,355 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:20:59,495 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:20:59,504 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 16:20:59,515 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:20:59,544 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:20:59,579 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 16:20:59,579 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59 WrapperNode
[2023-11-01 16:20:59,580 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 16:20:59,581 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 16:20:59,581 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 16:20:59,581 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 16:20:59,586 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,602 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,628 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2023-11-01 16:20:59,628 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 16:20:59,629 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 16:20:59,629 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 16:20:59,629 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 16:20:59,638 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,638 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,642 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,642 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,652 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,655 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,657 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,658 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,660 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 16:20:59,661 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 16:20:59,661 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 16:20:59,661 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 16:20:59,662 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (1/1) ...
[2023-11-01 16:20:59,667 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:20:59,675 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:20:59,691 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-01 16:20:59,694 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-01 16:20:59,722 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 16:20:59,722 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-01 16:20:59,723 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 16:20:59,723 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-01 16:20:59,723 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 16:20:59,724 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 16:20:59,724 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-01 16:20:59,724 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 16:20:59,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 16:20:59,725 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 16:20:59,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 16:20:59,727 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 16:20:59,855 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 16:20:59,857 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 16:21:00,148 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 16:21:00,155 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 16:21:00,155 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 16:21:00,157 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:21:00 BoogieIcfgContainer
[2023-11-01 16:21:00,157 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 16:21:00,159 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 16:21:00,160 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 16:21:00,162 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 16:21:00,162 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:20:59" (1/3) ...
[2023-11-01 16:21:00,163 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd8ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:21:00, skipping insertion in model container
[2023-11-01 16:21:00,163 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:20:59" (2/3) ...
[2023-11-01 16:21:00,163 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd8ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:21:00, skipping insertion in model container
[2023-11-01 16:21:00,163 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:21:00" (3/3) ...
[2023-11-01 16:21:00,165 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2023-11-01 16:21:00,171 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 16:21:00,179 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 16:21:00,179 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-01 16:21:00,179 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 16:21:00,225 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 16:21:00,253 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,316 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-11-01 16:21:00,317 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:21:00,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2023-11-01 16:21:00,322 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,326 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,330 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:21:00,339 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,341 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-11-01 16:21:00,377 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-11-01 16:21:00,378 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:21:00,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2023-11-01 16:21:00,380 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2023-11-01 16:21:03,305 INFO  L134        LiptonReduction]: Checked pairs total: 10042
[2023-11-01 16:21:03,306 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2023-11-01 16:21:03,320 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:21:03,325 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eee026c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:21:03,326 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-01 16:21:03,328 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2023-11-01 16:21:03,328 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:21:03,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:03,329 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:03,330 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:03,333 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:03,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -382401433, now seen corresponding path program 1 times
[2023-11-01 16:21:03,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:03,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909054782]
[2023-11-01 16:21:03,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:03,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:03,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:03,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:03,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:03,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909054782]
[2023-11-01 16:21:03,818 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909054782] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:03,819 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:03,819 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:21:03,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600926496]
[2023-11-01 16:21:03,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:03,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:21:03,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:03,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:21:03,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:21:04,343 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-11-01 16:21:04,347 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 136 flow. Second operand  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,347 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:04,347 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-11-01 16:21:04,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:04,561 INFO  L130       PetriNetUnfolder]: 57/287 cut-off events.
[2023-11-01 16:21:04,561 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-11-01 16:21:04,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 477 conditions, 287 events. 57/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1290 event pairs, 38 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 352. Up to 115 conditions per place. 
[2023-11-01 16:21:04,565 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 40 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2023-11-01 16:21:04,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 282 flow
[2023-11-01 16:21:04,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:21:04,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:21:04,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2023-11-01 16:21:04,580 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2023-11-01 16:21:04,580 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2023-11-01 16:21:04,581 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2023-11-01 16:21:04,583 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:04,585 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2023-11-01 16:21:04,590 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,600 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,601 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,604 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 700 transitions.
[2023-11-01 16:21:04,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 282 flow
[2023-11-01 16:21:04,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:21:04,611 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2023-11-01 16:21:04,612 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=65}
[2023-11-01 16:21:04,616 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2023-11-01 16:21:04,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2023-11-01 16:21:04,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,617 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:04,617 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:04,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 16:21:04,617 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:04,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:04,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094831862, now seen corresponding path program 1 times
[2023-11-01 16:21:04,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:04,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334020979]
[2023-11-01 16:21:04,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:04,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:04,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:04,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:04,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:04,674 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334020979]
[2023-11-01 16:21:04,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334020979] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:04,675 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:04,675 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 16:21:04,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805934420]
[2023-11-01 16:21:04,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:04,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 16:21:04,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:04,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 16:21:04,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-01 16:21:04,733 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 220
[2023-11-01 16:21:04,734 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 190 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,734 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:04,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 220
[2023-11-01 16:21:04,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:04,838 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2023-11-01 16:21:04,839 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2023-11-01 16:21:04,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 423 conditions, 243 events. 28/243 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 985 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 308. Up to 79 conditions per place. 
[2023-11-01 16:21:04,840 INFO  L137   encePairwiseOnDemand]: 216/220 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2023-11-01 16:21:04,841 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 276 flow
[2023-11-01 16:21:04,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 16:21:04,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 16:21:04,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2023-11-01 16:21:04,844 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2023-11-01 16:21:04,844 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2023-11-01 16:21:04,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2023-11-01 16:21:04,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:04,845 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2023-11-01 16:21:04,846 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,848 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,848 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,848 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2023-11-01 16:21:04,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 276 flow
[2023-11-01 16:21:04,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-11-01 16:21:04,852 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2023-11-01 16:21:04,852 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=66}
[2023-11-01 16:21:04,853 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2023-11-01 16:21:04,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2023-11-01 16:21:04,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:04,854 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:04,854 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:04,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 16:21:04,855 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:04,855 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:04,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103111380, now seen corresponding path program 1 times
[2023-11-01 16:21:04,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:04,856 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263539617]
[2023-11-01 16:21:04,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:04,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:04,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:05,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:05,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:05,037 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263539617]
[2023-11-01 16:21:05,038 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263539617] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:05,038 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:05,038 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:21:05,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317067232]
[2023-11-01 16:21:05,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:05,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:21:05,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:05,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:21:05,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:21:05,347 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-11-01 16:21:05,349 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:05,349 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:05,349 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-11-01 16:21:05,350 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:05,496 INFO  L130       PetriNetUnfolder]: 58/260 cut-off events.
[2023-11-01 16:21:05,497 INFO  L131       PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2023-11-01 16:21:05,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 535 conditions, 260 events. 58/260 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1139 event pairs, 36 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 404. Up to 111 conditions per place. 
[2023-11-01 16:21:05,499 INFO  L137   encePairwiseOnDemand]: 207/220 looper letters, 40 selfloop transitions, 6 changer transitions 5/77 dead transitions.
[2023-11-01 16:21:05,499 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 322 flow
[2023-11-01 16:21:05,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:21:05,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:21:05,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions.
[2023-11-01 16:21:05,502 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2023-11-01 16:21:05,502 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 696 transitions.
[2023-11-01 16:21:05,502 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions.
[2023-11-01 16:21:05,503 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:05,503 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions.
[2023-11-01 16:21:05,504 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:05,506 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:05,507 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:05,507 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 696 transitions.
[2023-11-01 16:21:05,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 322 flow
[2023-11-01 16:21:05,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 16:21:05,510 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2023-11-01 16:21:05,510 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=63}
[2023-11-01 16:21:05,510 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2023-11-01 16:21:05,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2023-11-01 16:21:05,511 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:05,511 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:05,511 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:05,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 16:21:05,512 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:05,512 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:05,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153489684, now seen corresponding path program 1 times
[2023-11-01 16:21:05,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:05,513 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090397452]
[2023-11-01 16:21:05,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:05,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:05,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:05,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:05,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:05,707 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090397452]
[2023-11-01 16:21:05,707 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090397452] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:05,707 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:05,708 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:21:05,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196040812]
[2023-11-01 16:21:05,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:05,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:21:05,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:05,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:21:05,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:21:06,005 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220
[2023-11-01 16:21:06,006 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,006 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:06,007 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220
[2023-11-01 16:21:06,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:06,209 INFO  L130       PetriNetUnfolder]: 254/667 cut-off events.
[2023-11-01 16:21:06,209 INFO  L131       PetriNetUnfolder]: For 109/109 co-relation queries the response was YES.
[2023-11-01 16:21:06,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 667 events. 254/667 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3164 event pairs, 211 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 1402. Up to 560 conditions per place. 
[2023-11-01 16:21:06,213 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 61 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2023-11-01 16:21:06,213 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 442 flow
[2023-11-01 16:21:06,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:21:06,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:21:06,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions.
[2023-11-01 16:21:06,216 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4553030303030303
[2023-11-01 16:21:06,216 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 601 transitions.
[2023-11-01 16:21:06,216 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions.
[2023-11-01 16:21:06,217 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:06,217 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions.
[2023-11-01 16:21:06,218 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,220 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,221 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,221 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 601 transitions.
[2023-11-01 16:21:06,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 442 flow
[2023-11-01 16:21:06,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 413 flow, removed 6 selfloop flow, removed 9 redundant places.
[2023-11-01 16:21:06,225 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2023-11-01 16:21:06,225 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2023-11-01 16:21:06,226 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2023-11-01 16:21:06,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2023-11-01 16:21:06,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,227 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:06,227 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:06,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 16:21:06,227 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:06,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:06,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -116177611, now seen corresponding path program 1 times
[2023-11-01 16:21:06,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:06,228 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699608777]
[2023-11-01 16:21:06,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:06,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:06,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:06,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:06,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:06,524 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699608777]
[2023-11-01 16:21:06,524 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699608777] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:06,524 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:06,524 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:21:06,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260995532]
[2023-11-01 16:21:06,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:06,525 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:21:06,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:06,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:21:06,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:21:06,919 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 220
[2023-11-01 16:21:06,920 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 318 flow. Second operand  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:06,920 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:06,920 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 220
[2023-11-01 16:21:06,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:07,249 INFO  L130       PetriNetUnfolder]: 161/521 cut-off events.
[2023-11-01 16:21:07,250 INFO  L131       PetriNetUnfolder]: For 233/237 co-relation queries the response was YES.
[2023-11-01 16:21:07,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 521 events. 161/521 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2662 event pairs, 25 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1224. Up to 202 conditions per place. 
[2023-11-01 16:21:07,254 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 83 selfloop transitions, 28 changer transitions 26/163 dead transitions.
[2023-11-01 16:21:07,255 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 885 flow
[2023-11-01 16:21:07,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:21:07,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:21:07,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-11-01 16:21:07,257 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6303030303030303
[2023-11-01 16:21:07,257 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-11-01 16:21:07,258 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-11-01 16:21:07,258 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:07,258 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-11-01 16:21:07,260 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:07,262 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:07,262 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:07,262 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 832 transitions.
[2023-11-01 16:21:07,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 885 flow
[2023-11-01 16:21:07,265 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 163 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 16:21:07,267 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2023-11-01 16:21:07,267 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=90, PETRI_TRANSITIONS=96}
[2023-11-01 16:21:07,268 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2023-11-01 16:21:07,268 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2023-11-01 16:21:07,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:07,269 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:07,269 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:07,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-01 16:21:07,269 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:07,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:07,270 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137239947, now seen corresponding path program 1 times
[2023-11-01 16:21:07,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:07,270 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366709954]
[2023-11-01 16:21:07,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:07,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:07,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:07,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:21:07,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:07,601 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366709954]
[2023-11-01 16:21:07,602 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366709954] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:21:07,602 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:21:07,602 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:21:07,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580132835]
[2023-11-01 16:21:07,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:21:07,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:21:07,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:07,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:21:07,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:21:08,028 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 220
[2023-11-01 16:21:08,029 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 543 flow. Second operand  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:08,029 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:08,029 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 220
[2023-11-01 16:21:08,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:08,180 INFO  L130       PetriNetUnfolder]: 89/377 cut-off events.
[2023-11-01 16:21:08,181 INFO  L131       PetriNetUnfolder]: For 348/380 co-relation queries the response was YES.
[2023-11-01 16:21:08,182 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 377 events. 89/377 cut-off events. For 348/380 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1824 event pairs, 24 based on Foata normal form. 8/380 useless extension candidates. Maximal degree in co-relation 992. Up to 171 conditions per place. 
[2023-11-01 16:21:08,184 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2023-11-01 16:21:08,184 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 681 flow
[2023-11-01 16:21:08,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:21:08,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:21:08,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions.
[2023-11-01 16:21:08,187 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2023-11-01 16:21:08,187 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 735 transitions.
[2023-11-01 16:21:08,187 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions.
[2023-11-01 16:21:08,188 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:08,188 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions.
[2023-11-01 16:21:08,190 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:08,192 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:08,192 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:08,192 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 735 transitions.
[2023-11-01 16:21:08,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 681 flow
[2023-11-01 16:21:08,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 657 flow, removed 12 selfloop flow, removed 0 redundant places.
[2023-11-01 16:21:08,197 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2023-11-01 16:21:08,197 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=82}
[2023-11-01 16:21:08,198 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2023-11-01 16:21:08,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2023-11-01 16:21:08,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:08,199 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:08,199 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:08,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-01 16:21:08,199 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:08,200 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:08,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -972606990, now seen corresponding path program 1 times
[2023-11-01 16:21:08,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:08,200 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785946368]
[2023-11-01 16:21:08,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:08,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:08,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:09,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:09,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:09,172 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785946368]
[2023-11-01 16:21:09,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785946368] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:21:09,173 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225491294]
[2023-11-01 16:21:09,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:09,173 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:21:09,174 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:21:09,176 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:21:09,177 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-01 16:21:09,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:09,292 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-11-01 16:21:09,304 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:21:09,534 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:21:09,535 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-01 16:21:10,019 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:21:10,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2023-11-01 16:21:10,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:10,033 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:21:10,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:21:10,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:21:10,365 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-01 16:21:10,429 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-01 16:21:10,512 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-01 16:21:10,586 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-01 16:21:10,666 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:10,668 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:10,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:10,671 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:10,674 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:10,674 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2023-11-01 16:21:10,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:10,688 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:21:12,190 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_30| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_30| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_408 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem10#1.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_408) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4))) (forall ((v_ArrVal_409 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_409) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2023-11-01 16:21:12,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16
[2023-11-01 16:21:12,278 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8
[2023-11-01 16:21:12,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:12,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [225491294] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:21:12,623 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:21:12,623 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 42
[2023-11-01 16:21:12,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621656183]
[2023-11-01 16:21:12,625 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:21:12,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-11-01 16:21:12,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:12,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-11-01 16:21:12,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1578, Unknown=17, NotChecked=82, Total=1892
[2023-11-01 16:21:13,497 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-11-01 16:21:13,500 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 486 flow. Second operand  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:13,501 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:13,501 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-11-01 16:21:13,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:16,341 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2023-11-01 16:21:16,341 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2023-11-01 16:21:16,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1028 events. 444/1028 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5028 event pairs, 10 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 3601. Up to 240 conditions per place. 
[2023-11-01 16:21:16,347 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2023-11-01 16:21:16,347 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2023-11-01 16:21:16,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 16:21:16,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 16:21:16,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2023-11-01 16:21:16,351 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528708133971292
[2023-11-01 16:21:16,351 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2023-11-01 16:21:16,351 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2023-11-01 16:21:16,352 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:21:16,352 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2023-11-01 16:21:16,354 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 55.63157894736842) internal successors, (1057), 19 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:16,357 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:16,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:16,358 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2023-11-01 16:21:16,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2023-11-01 16:21:16,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 16:21:16,367 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2023-11-01 16:21:16,368 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=975, PETRI_PLACES=95, PETRI_TRANSITIONS=122}
[2023-11-01 16:21:16,368 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2023-11-01 16:21:16,368 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2023-11-01 16:21:16,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:16,369 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:21:16,369 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:21:16,379 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-01 16:21:16,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:21:16,571 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:21:16,572 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:21:16,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574108551, now seen corresponding path program 1 times
[2023-11-01 16:21:16,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:21:16,573 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496019560]
[2023-11-01 16:21:16,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:16,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:21:16,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:17,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:17,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:21:17,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496019560]
[2023-11-01 16:21:17,884 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496019560] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:21:17,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054996429]
[2023-11-01 16:21:17,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:21:17,885 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:21:17,885 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:21:17,886 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:21:17,888 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-01 16:21:18,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:21:18,006 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-11-01 16:21:18,014 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:21:18,239 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:21:18,239 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-01 16:21:18,247 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:18,248 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:21:18,770 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:21:18,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2023-11-01 16:21:18,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:18,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21
[2023-11-01 16:21:18,970 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:21:19,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,034 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:21:19,099 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:21:19,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,182 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,183 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:21:19,332 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-01 16:21:19,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-01 16:21:19,350 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13
[2023-11-01 16:21:19,358 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:21:19,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:21:19,433 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,434 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:21:19,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:21:19,480 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:21:19,595 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,596 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,599 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,601 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,602 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,603 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:21:19,606 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:19,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:21:19,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:21:19,657 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:21:21,872 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2023-11-01 16:21:23,952 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))))) is different from false
[2023-11-01 16:21:26,037 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-01 16:21:28,119 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse7 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-01 16:21:29,747 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0) .cse10 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-01 16:21:29,798 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:29,799 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2023-11-01 16:21:29,818 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:29,819 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 220
[2023-11-01 16:21:29,834 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198
[2023-11-01 16:21:29,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102
[2023-11-01 16:21:29,923 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:29,924 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 181
[2023-11-01 16:21:30,124 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:21:30,125 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-01 16:21:30,132 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:21:30,153 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:21:30,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2023-11-01 16:21:30,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2023-11-01 16:21:30,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-01 16:21:30,224 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:21:30,225 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-01 16:21:30,235 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:21:30,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-01 16:21:30,836 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585))) (or (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_584))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2023-11-01 16:21:30,939 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585))) (or (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_584))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))) is different from false
[2023-11-01 16:21:30,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:21:30,944 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054996429] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:21:30,944 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:21:30,944 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-11-01 16:21:30,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765707962]
[2023-11-01 16:21:30,945 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:21:30,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-11-01 16:21:30,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:21:30,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-01 16:21:30,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1520, Unknown=15, NotChecked=602, Total=2352
[2023-11-01 16:21:31,157 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:21:31,161 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 975 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:21:31,162 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:21:31,162 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:21:31,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:21:58,421 WARN  L233               SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 86 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-11-01 16:22:04,941 INFO  L130       PetriNetUnfolder]: 466/1118 cut-off events.
[2023-11-01 16:22:04,942 INFO  L131       PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES.
[2023-11-01 16:22:04,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1118 events. 466/1118 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5792 event pairs, 117 based on Foata normal form. 16/1123 useless extension candidates. Maximal degree in co-relation 4414. Up to 746 conditions per place. 
[2023-11-01 16:22:04,950 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 188 selfloop transitions, 56 changer transitions 0/245 dead transitions.
[2023-11-01 16:22:04,950 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 2197 flow
[2023-11-01 16:22:04,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-01 16:22:04,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-01 16:22:04,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1402 transitions.
[2023-11-01 16:22:04,956 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2549090909090909
[2023-11-01 16:22:04,956 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1402 transitions.
[2023-11-01 16:22:04,956 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1402 transitions.
[2023-11-01 16:22:04,957 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:22:04,957 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1402 transitions.
[2023-11-01 16:22:04,959 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 56.08) internal successors, (1402), 25 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:04,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:04,965 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:04,965 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 25 states and 1402 transitions.
[2023-11-01 16:22:04,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 2197 flow
[2023-11-01 16:22:04,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 245 transitions, 2168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-01 16:22:04,978 INFO  L231             Difference]: Finished difference. Result has 123 places, 163 transitions, 1496 flow
[2023-11-01 16:22:04,979 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1496, PETRI_PLACES=123, PETRI_TRANSITIONS=163}
[2023-11-01 16:22:04,979 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places.
[2023-11-01 16:22:04,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1496 flow
[2023-11-01 16:22:04,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:04,980 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:22:04,980 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:22:04,989 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-01 16:22:05,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:05,182 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:22:05,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:22:05,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -324057465, now seen corresponding path program 2 times
[2023-11-01 16:22:05,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:22:05,184 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629491720]
[2023-11-01 16:22:05,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:22:05,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:22:05,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:22:06,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:06,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:22:06,375 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629491720]
[2023-11-01 16:22:06,375 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629491720] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:22:06,375 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982552077]
[2023-11-01 16:22:06,375 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:22:06,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:06,375 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:22:06,377 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:22:06,379 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-01 16:22:06,570 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:22:06,571 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:22:06,573 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2023-11-01 16:22:06,579 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:22:06,831 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:06,832 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-01 16:22:06,841 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:06,842 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:22:07,453 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:07,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:22:07,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:07,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2023-11-01 16:22:07,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:22:07,757 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:22:07,838 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:22:07,906 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:07,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:22:07,994 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:07,995 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:07,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:22:08,059 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,060 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,061 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,062 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:22:08,159 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,160 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,162 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,164 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,165 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,167 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,168 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:08,171 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:08,171 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:22:08,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:08,231 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:22:09,797 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_767))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_766))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))) is different from false
[2023-11-01 16:22:09,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2023-11-01 16:22:09,995 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [982552077] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:22:09,995 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:22:09,995 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2023-11-01 16:22:09,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791885619]
[2023-11-01 16:22:09,996 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:22:09,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2023-11-01 16:22:09,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:22:09,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2023-11-01 16:22:09,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1751, Unknown=19, NotChecked=86, Total=2070
[2023-11-01 16:22:10,697 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:22:10,701 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 163 transitions, 1496 flow. Second operand  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:10,701 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:22:10,701 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:22:10,701 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:22:15,087 INFO  L130       PetriNetUnfolder]: 538/1273 cut-off events.
[2023-11-01 16:22:15,087 INFO  L131       PetriNetUnfolder]: For 4500/4500 co-relation queries the response was YES.
[2023-11-01 16:22:15,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1273 events. 538/1273 cut-off events. For 4500/4500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6804 event pairs, 16 based on Foata normal form. 20/1282 useless extension candidates. Maximal degree in co-relation 5844. Up to 210 conditions per place. 
[2023-11-01 16:22:15,100 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 282 selfloop transitions, 106 changer transitions 0/389 dead transitions.
[2023-11-01 16:22:15,100 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 3888 flow
[2023-11-01 16:22:15,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-11-01 16:22:15,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-11-01 16:22:15,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2023-11-01 16:22:15,105 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2023-11-01 16:22:15,105 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2023-11-01 16:22:15,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2023-11-01 16:22:15,105 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:22:15,106 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2023-11-01 16:22:15,108 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:15,113 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:15,114 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:15,114 INFO  L175             Difference]: Start difference. First operand has 123 places, 163 transitions, 1496 flow. Second operand 26 states and 1508 transitions.
[2023-11-01 16:22:15,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 389 transitions, 3888 flow
[2023-11-01 16:22:15,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 389 transitions, 3819 flow, removed 22 selfloop flow, removed 8 redundant places.
[2023-11-01 16:22:15,137 INFO  L231             Difference]: Finished difference. Result has 149 places, 234 transitions, 2434 flow
[2023-11-01 16:22:15,137 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2434, PETRI_PLACES=149, PETRI_TRANSITIONS=234}
[2023-11-01 16:22:15,137 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places.
[2023-11-01 16:22:15,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 2434 flow
[2023-11-01 16:22:15,139 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:15,139 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:22:15,139 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:22:15,148 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-01 16:22:15,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:15,340 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:22:15,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:22:15,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088014417, now seen corresponding path program 3 times
[2023-11-01 16:22:15,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:22:15,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766828106]
[2023-11-01 16:22:15,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:22:15,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:22:15,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:22:16,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:16,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:22:16,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766828106]
[2023-11-01 16:22:16,143 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766828106] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:22:16,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547862899]
[2023-11-01 16:22:16,143 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-01 16:22:16,143 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:16,144 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:22:16,145 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:22:16,147 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-01 16:22:16,324 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-01 16:22:16,324 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:22:16,327 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-11-01 16:22:16,332 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:22:16,509 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:16,510 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-01 16:22:16,941 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:16,941 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:22:16,953 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:16,953 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:22:17,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:22:17,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:22:17,164 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:22:17,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:22:17,269 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:22:17,320 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:22:17,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:17,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:17,408 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:17,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:17,412 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:17,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:22:17,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:17,422 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:22:20,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2023-11-01 16:22:20,847 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (forall ((v_ArrVal_944 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_944) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_44| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2023-11-01 16:22:20,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:22:20,849 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [547862899] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:22:20,850 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:22:20,850 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-11-01 16:22:20,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582325563]
[2023-11-01 16:22:20,850 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:22:20,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-11-01 16:22:20,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:22:20,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-11-01 16:22:20,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1433, Unknown=10, NotChecked=78, Total=1722
[2023-11-01 16:22:21,583 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:22:21,586 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 234 transitions, 2434 flow. Second operand  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:21,586 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:22:21,586 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:22:21,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:22:26,432 INFO  L130       PetriNetUnfolder]: 649/1538 cut-off events.
[2023-11-01 16:22:26,432 INFO  L131       PetriNetUnfolder]: For 9579/9579 co-relation queries the response was YES.
[2023-11-01 16:22:26,438 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 1538 events. 649/1538 cut-off events. For 9579/9579 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8759 event pairs, 27 based on Foata normal form. 21/1538 useless extension candidates. Maximal degree in co-relation 8101. Up to 454 conditions per place. 
[2023-11-01 16:22:26,448 INFO  L137   encePairwiseOnDemand]: 201/220 looper letters, 291 selfloop transitions, 148 changer transitions 0/440 dead transitions.
[2023-11-01 16:22:26,448 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 440 transitions, 5114 flow
[2023-11-01 16:22:26,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-11-01 16:22:26,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-11-01 16:22:26,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1222 transitions.
[2023-11-01 16:22:26,451 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2645021645021645
[2023-11-01 16:22:26,451 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1222 transitions.
[2023-11-01 16:22:26,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1222 transitions.
[2023-11-01 16:22:26,452 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:22:26,452 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1222 transitions.
[2023-11-01 16:22:26,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 58.19047619047619) internal successors, (1222), 21 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:26,461 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:26,462 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:26,462 INFO  L175             Difference]: Start difference. First operand has 149 places, 234 transitions, 2434 flow. Second operand 21 states and 1222 transitions.
[2023-11-01 16:22:26,462 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 440 transitions, 5114 flow
[2023-11-01 16:22:26,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 440 transitions, 4973 flow, removed 29 selfloop flow, removed 11 redundant places.
[2023-11-01 16:22:26,502 INFO  L231             Difference]: Finished difference. Result has 171 places, 304 transitions, 3703 flow
[2023-11-01 16:22:26,502 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3703, PETRI_PLACES=171, PETRI_TRANSITIONS=304}
[2023-11-01 16:22:26,502 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 105 predicate places.
[2023-11-01 16:22:26,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 304 transitions, 3703 flow
[2023-11-01 16:22:26,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:26,503 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:22:26,503 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:22:26,511 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-11-01 16:22:26,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:26,705 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:22:26,705 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:22:26,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -189400963, now seen corresponding path program 4 times
[2023-11-01 16:22:26,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:22:26,706 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126760330]
[2023-11-01 16:22:26,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:22:26,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:22:26,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:22:28,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:28,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:22:28,572 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126760330]
[2023-11-01 16:22:28,572 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126760330] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:22:28,572 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068321589]
[2023-11-01 16:22:28,572 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-01 16:22:28,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:22:28,573 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:22:28,574 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:22:28,576 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-01 16:22:29,042 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-01 16:22:29,042 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:22:29,045 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjunts are in the unsatisfiable core
[2023-11-01 16:22:29,051 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:22:29,332 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:29,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-01 16:22:29,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:29,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:22:29,984 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:22:29,985 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:22:29,997 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:29,998 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2023-11-01 16:22:30,255 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:22:30,339 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,340 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:22:30,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,408 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,409 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:22:30,503 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,506 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:22:30,605 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-01 16:22:30,606 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-01 16:22:30,614 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:30,614 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 13
[2023-11-01 16:22:30,629 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:22:30,640 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:22:30,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:22:30,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:22:30,789 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:22:30,901 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,904 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,906 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,908 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,909 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:22:30,911 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:30,912 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:22:30,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:22:30,976 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:22:31,201 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2023-11-01 16:22:31,303 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))))) is different from false
[2023-11-01 16:22:31,370 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))))) is different from false
[2023-11-01 16:22:39,032 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:39,032 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-01 16:22:39,052 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:39,052 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 236
[2023-11-01 16:22:39,063 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214
[2023-11-01 16:22:39,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112
[2023-11-01 16:22:39,139 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:22:39,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 196
[2023-11-01 16:22:39,258 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:22:39,258 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-01 16:22:39,266 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:22:39,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2023-11-01 16:22:39,273 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:22:39,273 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-01 16:22:40,119 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1122))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false
[2023-11-01 16:22:40,185 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2023-11-01 16:22:40,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:22:40,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068321589] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:22:40,188 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:22:40,188 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-11-01 16:22:40,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043078434]
[2023-11-01 16:22:40,189 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:22:40,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-11-01 16:22:40,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:22:40,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-01 16:22:40,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1660, Unknown=29, NotChecked=440, Total=2352
[2023-11-01 16:22:40,193 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:22:40,196 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 304 transitions, 3703 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:22:40,196 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:22:40,196 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:22:40,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:23:02,552 WARN  L233               SmtUtils]: Spent 15.24s on a formula simplification. DAG size of input: 73 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-11-01 16:23:04,886 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:23:07,222 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:23:09,250 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:23:11,278 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:23:17,498 INFO  L130       PetriNetUnfolder]: 684/1657 cut-off events.
[2023-11-01 16:23:17,498 INFO  L131       PetriNetUnfolder]: For 16567/16567 co-relation queries the response was YES.
[2023-11-01 16:23:17,505 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10017 conditions, 1657 events. 684/1657 cut-off events. For 16567/16567 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9731 event pairs, 161 based on Foata normal form. 16/1673 useless extension candidates. Maximal degree in co-relation 9959. Up to 1037 conditions per place. 
[2023-11-01 16:23:17,512 INFO  L137   encePairwiseOnDemand]: 195/220 looper letters, 286 selfloop transitions, 131 changer transitions 0/418 dead transitions.
[2023-11-01 16:23:17,513 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 418 transitions, 5380 flow
[2023-11-01 16:23:17,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-01 16:23:17,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-01 16:23:17,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1320 transitions.
[2023-11-01 16:23:17,516 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2608695652173913
[2023-11-01 16:23:17,516 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1320 transitions.
[2023-11-01 16:23:17,516 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1320 transitions.
[2023-11-01 16:23:17,516 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:23:17,516 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1320 transitions.
[2023-11-01 16:23:17,518 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 57.391304347826086) internal successors, (1320), 23 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:17,522 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:17,522 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:17,522 INFO  L175             Difference]: Start difference. First operand has 171 places, 304 transitions, 3703 flow. Second operand 23 states and 1320 transitions.
[2023-11-01 16:23:17,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 418 transitions, 5380 flow
[2023-11-01 16:23:17,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 418 transitions, 5300 flow, removed 29 selfloop flow, removed 7 redundant places.
[2023-11-01 16:23:17,591 INFO  L231             Difference]: Finished difference. Result has 198 places, 350 transitions, 4688 flow
[2023-11-01 16:23:17,591 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4688, PETRI_PLACES=198, PETRI_TRANSITIONS=350}
[2023-11-01 16:23:17,592 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 132 predicate places.
[2023-11-01 16:23:17,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 350 transitions, 4688 flow
[2023-11-01 16:23:17,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:17,593 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:23:17,593 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:23:17,605 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-01 16:23:17,794 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2023-11-01 16:23:17,794 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:23:17,795 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:23:17,796 INFO  L85        PathProgramCache]: Analyzing trace with hash 439464892, now seen corresponding path program 2 times
[2023-11-01 16:23:17,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:23:17,796 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469246674]
[2023-11-01 16:23:17,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:23:17,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:23:17,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:23:18,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:23:18,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:23:18,701 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469246674]
[2023-11-01 16:23:18,701 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469246674] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:23:18,702 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791945517]
[2023-11-01 16:23:18,702 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:23:18,702 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:23:18,702 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:23:18,704 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:23:18,706 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-01 16:23:18,935 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:23:18,936 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:23:18,938 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-11-01 16:23:18,943 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:23:19,153 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:23:19,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-01 16:23:19,626 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:23:19,626 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:23:19,634 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:19,635 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:23:19,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:23:19,826 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:23:19,921 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-01 16:23:19,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-01 16:23:20,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-01 16:23:20,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-01 16:23:20,237 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:20,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:20,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:20,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:20,247 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:20,247 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2023-11-01 16:23:20,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:23:20,263 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:23:23,879 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2023-11-01 16:23:23,912 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-01 16:23:23,938 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_48| Int)) (or (forall ((v_ArrVal_1303 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_48| v_ArrVal_1303) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_48| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2023-11-01 16:23:23,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:23:23,942 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791945517] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:23:23,942 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:23:23,942 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-11-01 16:23:23,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215175397]
[2023-11-01 16:23:23,943 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:23:23,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-11-01 16:23:23,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:23:23,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-11-01 16:23:23,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1364, Unknown=6, NotChecked=154, Total=1722
[2023-11-01 16:23:24,716 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-11-01 16:23:24,719 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 350 transitions, 4688 flow. Second operand  has 42 states, 42 states have (on average 50.45238095238095) internal successors, (2119), 42 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:24,719 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:23:24,719 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-11-01 16:23:24,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:23:27,951 INFO  L130       PetriNetUnfolder]: 716/1728 cut-off events.
[2023-11-01 16:23:27,952 INFO  L131       PetriNetUnfolder]: For 22013/22013 co-relation queries the response was YES.
[2023-11-01 16:23:27,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11605 conditions, 1728 events. 716/1728 cut-off events. For 22013/22013 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10295 event pairs, 55 based on Foata normal form. 10/1738 useless extension candidates. Maximal degree in co-relation 11535. Up to 630 conditions per place. 
[2023-11-01 16:23:27,971 INFO  L137   encePairwiseOnDemand]: 206/220 looper letters, 390 selfloop transitions, 114 changer transitions 0/505 dead transitions.
[2023-11-01 16:23:27,971 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 505 transitions, 7534 flow
[2023-11-01 16:23:27,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-01 16:23:27,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-01 16:23:27,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 891 transitions.
[2023-11-01 16:23:27,973 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.253125
[2023-11-01 16:23:27,973 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 891 transitions.
[2023-11-01 16:23:27,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 891 transitions.
[2023-11-01 16:23:27,974 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:23:27,974 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 891 transitions.
[2023-11-01 16:23:27,975 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 55.6875) internal successors, (891), 16 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:27,977 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:27,977 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:27,977 INFO  L175             Difference]: Start difference. First operand has 198 places, 350 transitions, 4688 flow. Second operand 16 states and 891 transitions.
[2023-11-01 16:23:27,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 505 transitions, 7534 flow
[2023-11-01 16:23:28,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 505 transitions, 7404 flow, removed 44 selfloop flow, removed 8 redundant places.
[2023-11-01 16:23:28,070 INFO  L231             Difference]: Finished difference. Result has 210 places, 382 transitions, 5324 flow
[2023-11-01 16:23:28,070 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4590, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5324, PETRI_PLACES=210, PETRI_TRANSITIONS=382}
[2023-11-01 16:23:28,071 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 144 predicate places.
[2023-11-01 16:23:28,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 382 transitions, 5324 flow
[2023-11-01 16:23:28,072 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 50.45238095238095) internal successors, (2119), 42 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:23:28,072 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:23:28,072 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:23:28,081 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-01 16:23:28,272 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-11-01 16:23:28,273 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:23:28,273 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:23:28,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 395210955, now seen corresponding path program 5 times
[2023-11-01 16:23:28,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:23:28,274 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213519285]
[2023-11-01 16:23:28,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:23:28,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:23:28,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:23:29,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:23:29,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:23:29,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213519285]
[2023-11-01 16:23:29,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213519285] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:23:29,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556375228]
[2023-11-01 16:23:29,803 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-01 16:23:29,804 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:23:29,804 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:23:29,805 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:23:29,808 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-01 16:23:30,073 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:23:30,074 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:23:30,076 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-11-01 16:23:30,085 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:23:30,291 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:23:30,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49
[2023-11-01 16:23:30,764 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:23:30,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:23:30,773 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:30,775 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:23:31,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:23:31,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:23:31,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:23:31,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:23:31,398 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-01 16:23:31,399 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-01 16:23:31,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13
[2023-11-01 16:23:31,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:23:31,438 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:23:31,537 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,538 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:23:31,577 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,578 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:23:31,610 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:23:31,764 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,767 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,770 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:23:31,773 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:31,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:23:31,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:23:31,788 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:23:32,055 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false
[2023-11-01 16:23:32,155 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false
[2023-11-01 16:23:48,585 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:48,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2023-11-01 16:23:48,604 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:48,604 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 412 treesize of output 384
[2023-11-01 16:23:48,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 382
[2023-11-01 16:23:48,703 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206
[2023-11-01 16:23:48,735 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:48,736 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 306 treesize of output 286
[2023-11-01 16:23:49,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:49,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-01 16:23:49,049 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:23:49,068 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:23:49,069 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2023-11-01 16:23:49,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2023-11-01 16:23:49,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-01 16:23:49,150 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:23:49,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-01 16:23:49,157 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:23:49,173 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:23:49,174 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2023-11-01 16:23:49,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2023-11-01 16:23:49,196 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-01 16:23:49,240 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:23:49,240 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-01 16:23:56,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63
[2023-11-01 16:23:56,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56
[2023-11-01 16:23:56,258 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-11-01 16:23:56,296 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1480) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1480) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2023-11-01 16:23:56,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:23:56,299 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [556375228] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:23:56,299 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:23:56,299 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 45
[2023-11-01 16:23:56,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545503983]
[2023-11-01 16:23:56,300 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:23:56,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2023-11-01 16:23:56,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:23:56,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2023-11-01 16:23:56,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1593, Unknown=26, NotChecked=340, Total=2162
[2023-11-01 16:24:01,039 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:04,547 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:10,736 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:14,140 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:17,094 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:19,249 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:22,979 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 16:24:23,070 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:24:23,073 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 382 transitions, 5324 flow. Second operand  has 47 states, 47 states have (on average 52.38297872340426) internal successors, (2462), 47 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:23,073 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:24:23,073 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:24:23,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:24:35,986 INFO  L130       PetriNetUnfolder]: 768/1897 cut-off events.
[2023-11-01 16:24:35,986 INFO  L131       PetriNetUnfolder]: For 27271/27271 co-relation queries the response was YES.
[2023-11-01 16:24:35,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13061 conditions, 1897 events. 768/1897 cut-off events. For 27271/27271 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11816 event pairs, 138 based on Foata normal form. 16/1913 useless extension candidates. Maximal degree in co-relation 12986. Up to 1143 conditions per place. 
[2023-11-01 16:24:36,003 INFO  L137   encePairwiseOnDemand]: 195/220 looper letters, 344 selfloop transitions, 155 changer transitions 0/500 dead transitions.
[2023-11-01 16:24:36,003 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 500 transitions, 7598 flow
[2023-11-01 16:24:36,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-01 16:24:36,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-01 16:24:36,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1272 transitions.
[2023-11-01 16:24:36,006 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2628099173553719
[2023-11-01 16:24:36,006 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1272 transitions.
[2023-11-01 16:24:36,006 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1272 transitions.
[2023-11-01 16:24:36,006 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:24:36,006 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1272 transitions.
[2023-11-01 16:24:36,008 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 57.81818181818182) internal successors, (1272), 22 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:36,011 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 220.0) internal successors, (5060), 23 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:36,011 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 220.0) internal successors, (5060), 23 states have internal predecessors, (5060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:36,011 INFO  L175             Difference]: Start difference. First operand has 210 places, 382 transitions, 5324 flow. Second operand 22 states and 1272 transitions.
[2023-11-01 16:24:36,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 500 transitions, 7598 flow
[2023-11-01 16:24:36,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 500 transitions, 7333 flow, removed 40 selfloop flow, removed 10 redundant places.
[2023-11-01 16:24:36,137 INFO  L231             Difference]: Finished difference. Result has 231 places, 425 transitions, 6404 flow
[2023-11-01 16:24:36,137 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=5100, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6404, PETRI_PLACES=231, PETRI_TRANSITIONS=425}
[2023-11-01 16:24:36,137 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 165 predicate places.
[2023-11-01 16:24:36,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 425 transitions, 6404 flow
[2023-11-01 16:24:36,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 52.38297872340426) internal successors, (2462), 47 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:36,138 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:24:36,138 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:24:36,147 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-01 16:24:36,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2023-11-01 16:24:36,340 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:24:36,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:24:36,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -596649773, now seen corresponding path program 6 times
[2023-11-01 16:24:36,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:24:36,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004135377]
[2023-11-01 16:24:36,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:24:36,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:24:36,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:24:37,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:24:37,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:24:37,671 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004135377]
[2023-11-01 16:24:37,671 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004135377] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:24:37,672 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739644691]
[2023-11-01 16:24:37,672 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-11-01 16:24:37,672 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:24:37,672 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:24:37,673 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:24:37,675 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-01 16:24:37,867 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-11-01 16:24:37,867 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:24:37,869 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-11-01 16:24:37,874 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:24:38,049 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:24:38,049 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49
[2023-11-01 16:24:38,457 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:24:38,458 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:24:38,463 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:38,463 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:24:38,703 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:24:38,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:24:38,785 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:24:38,796 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:38,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:24:38,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:38,851 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:24:38,867 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:38,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:24:38,883 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:38,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:24:38,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:24:39,004 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:24:39,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:24:39,175 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:39,176 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:39,177 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:39,179 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:39,182 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:39,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:24:39,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:24:39,192 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:24:41,149 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1669))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0) .cse7 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1669))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0) .cse7 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1669))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0) .cse7 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1669))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0) .cse7 0))))) (store .cse12 .cse2 (store (select .cse12 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2023-11-01 16:24:41,221 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:41,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 90
[2023-11-01 16:24:41,240 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:24:41,240 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 682 treesize of output 662
[2023-11-01 16:24:41,260 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:41,261 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 492
[2023-11-01 16:24:41,273 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 402
[2023-11-01 16:24:41,371 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:41,371 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 88
[2023-11-01 16:24:41,397 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:41,398 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 738 treesize of output 718
[2023-11-01 16:24:41,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 738 treesize of output 708
[2023-11-01 16:24:42,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2023-11-01 16:24:42,436 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:42,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 90
[2023-11-01 16:24:42,439 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:24:42,460 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:24:42,460 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 218
[2023-11-01 16:24:42,469 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86
[2023-11-01 16:24:42,507 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:42,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 90
[2023-11-01 16:24:42,512 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:24:42,527 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:24:42,527 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 218
[2023-11-01 16:24:42,535 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86
[2023-11-01 16:24:43,293 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63
[2023-11-01 16:24:43,297 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56
[2023-11-01 16:24:43,449 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1661 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1661 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2023-11-01 16:24:43,476 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1661 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1661) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1661 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1661) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) is different from false
[2023-11-01 16:24:43,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:24:43,479 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [739644691] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:24:43,479 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:24:43,479 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 46
[2023-11-01 16:24:43,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443236353]
[2023-11-01 16:24:43,479 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:24:43,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2023-11-01 16:24:43,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:24:43,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2023-11-01 16:24:43,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1782, Unknown=22, NotChecked=264, Total=2256
[2023-11-01 16:24:43,704 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:24:43,706 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 425 transitions, 6404 flow. Second operand  has 48 states, 48 states have (on average 52.333333333333336) internal successors, (2512), 48 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:43,706 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:24:43,706 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:24:43,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:24:57,010 INFO  L130       PetriNetUnfolder]: 916/2241 cut-off events.
[2023-11-01 16:24:57,010 INFO  L131       PetriNetUnfolder]: For 45952/45952 co-relation queries the response was YES.
[2023-11-01 16:24:57,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16711 conditions, 2241 events. 916/2241 cut-off events. For 45952/45952 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14581 event pairs, 160 based on Foata normal form. 20/2261 useless extension candidates. Maximal degree in co-relation 16627. Up to 1145 conditions per place. 
[2023-11-01 16:24:57,031 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 441 selfloop transitions, 196 changer transitions 0/638 dead transitions.
[2023-11-01 16:24:57,031 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 638 transitions, 10310 flow
[2023-11-01 16:24:57,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-01 16:24:57,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-01 16:24:57,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1358 transitions.
[2023-11-01 16:24:57,033 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2683794466403162
[2023-11-01 16:24:57,033 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1358 transitions.
[2023-11-01 16:24:57,034 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1358 transitions.
[2023-11-01 16:24:57,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:24:57,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1358 transitions.
[2023-11-01 16:24:57,036 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 59.04347826086956) internal successors, (1358), 23 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:57,039 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:57,039 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:57,039 INFO  L175             Difference]: Start difference. First operand has 231 places, 425 transitions, 6404 flow. Second operand 23 states and 1358 transitions.
[2023-11-01 16:24:57,039 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 638 transitions, 10310 flow
[2023-11-01 16:24:57,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 638 transitions, 10135 flow, removed 59 selfloop flow, removed 12 redundant places.
[2023-11-01 16:24:57,235 INFO  L231             Difference]: Finished difference. Result has 250 places, 491 transitions, 8230 flow
[2023-11-01 16:24:57,236 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=6295, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8230, PETRI_PLACES=250, PETRI_TRANSITIONS=491}
[2023-11-01 16:24:57,236 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 184 predicate places.
[2023-11-01 16:24:57,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 491 transitions, 8230 flow
[2023-11-01 16:24:57,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 48 states, 48 states have (on average 52.333333333333336) internal successors, (2512), 48 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:24:57,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:24:57,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:24:57,245 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-11-01 16:24:57,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-11-01 16:24:57,438 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:24:57,439 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:24:57,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -1144488818, now seen corresponding path program 3 times
[2023-11-01 16:24:57,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:24:57,439 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443820180]
[2023-11-01 16:24:57,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:24:57,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:24:57,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:24:58,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:24:58,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:24:58,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443820180]
[2023-11-01 16:24:58,311 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443820180] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:24:58,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172679785]
[2023-11-01 16:24:58,311 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-01 16:24:58,311 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:24:58,312 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:24:58,313 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:24:58,316 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-01 16:24:58,542 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-01 16:24:58,542 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:24:58,544 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-11-01 16:24:58,548 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:24:58,743 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:24:58,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-01 16:24:59,169 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:24:59,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:24:59,179 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:59,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:24:59,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2023-11-01 16:24:59,399 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:24:59,442 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-01 16:24:59,514 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-01 16:24:59,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-01 16:24:59,658 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-01 16:24:59,744 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:59,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:59,747 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:59,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:24:59,751 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:24:59,751 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2023-11-01 16:24:59,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:24:59,764 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:25:06,288 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2023-11-01 16:25:06,420 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_54| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_54| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (forall ((v_ArrVal_1842 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_54| v_ArrVal_1842) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) is different from false
[2023-11-01 16:25:06,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:25:06,422 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172679785] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:25:06,422 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:25:06,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 39
[2023-11-01 16:25:06,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884822199]
[2023-11-01 16:25:06,423 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:25:06,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2023-11-01 16:25:06,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:25:06,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2023-11-01 16:25:06,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1373, Unknown=15, NotChecked=76, Total=1640
[2023-11-01 16:25:07,478 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-11-01 16:25:07,481 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 491 transitions, 8230 flow. Second operand  has 41 states, 41 states have (on average 50.46341463414634) internal successors, (2069), 41 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:07,481 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:25:07,481 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-11-01 16:25:07,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:25:11,298 INFO  L130       PetriNetUnfolder]: 939/2293 cut-off events.
[2023-11-01 16:25:11,298 INFO  L131       PetriNetUnfolder]: For 56167/56167 co-relation queries the response was YES.
[2023-11-01 16:25:11,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18368 conditions, 2293 events. 939/2293 cut-off events. For 56167/56167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15041 event pairs, 86 based on Foata normal form. 10/2303 useless extension candidates. Maximal degree in co-relation 18276. Up to 820 conditions per place. 
[2023-11-01 16:25:11,323 INFO  L137   encePairwiseOnDemand]: 202/220 looper letters, 395 selfloop transitions, 230 changer transitions 0/626 dead transitions.
[2023-11-01 16:25:11,324 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 626 transitions, 11539 flow
[2023-11-01 16:25:11,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-01 16:25:11,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-01 16:25:11,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 890 transitions.
[2023-11-01 16:25:11,326 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528409090909091
[2023-11-01 16:25:11,326 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 890 transitions.
[2023-11-01 16:25:11,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 890 transitions.
[2023-11-01 16:25:11,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:25:11,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 890 transitions.
[2023-11-01 16:25:11,327 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 55.625) internal successors, (890), 16 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:11,330 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:11,330 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:11,330 INFO  L175             Difference]: Start difference. First operand has 250 places, 491 transitions, 8230 flow. Second operand 16 states and 890 transitions.
[2023-11-01 16:25:11,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 626 transitions, 11539 flow
[2023-11-01 16:25:11,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 626 transitions, 11385 flow, removed 43 selfloop flow, removed 12 redundant places.
[2023-11-01 16:25:11,606 INFO  L231             Difference]: Finished difference. Result has 258 places, 520 transitions, 9131 flow
[2023-11-01 16:25:11,606 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=8076, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9131, PETRI_PLACES=258, PETRI_TRANSITIONS=520}
[2023-11-01 16:25:11,607 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 192 predicate places.
[2023-11-01 16:25:11,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 520 transitions, 9131 flow
[2023-11-01 16:25:11,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 41 states have (on average 50.46341463414634) internal successors, (2069), 41 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:11,607 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:25:11,608 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:25:11,615 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-01 16:25:11,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:25:11,809 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:25:11,809 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:25:11,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 1556426459, now seen corresponding path program 7 times
[2023-11-01 16:25:11,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:25:11,810 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747782688]
[2023-11-01 16:25:11,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:25:11,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:25:11,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:25:13,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:25:13,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:25:13,202 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747782688]
[2023-11-01 16:25:13,202 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747782688] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:25:13,202 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375335282]
[2023-11-01 16:25:13,202 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2023-11-01 16:25:13,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:25:13,203 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:25:13,204 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:25:13,206 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-01 16:25:13,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:25:13,380 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 63 conjunts are in the unsatisfiable core
[2023-11-01 16:25:13,386 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:25:13,684 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:25:13,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-01 16:25:13,703 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:13,704 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-11-01 16:25:14,322 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:25:14,322 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:25:14,338 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:14,339 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2023-11-01 16:25:14,757 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:25:14,864 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:14,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:25:14,963 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:25:14,977 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:14,978 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39
[2023-11-01 16:25:14,999 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-01 16:25:15,073 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-01 16:25:15,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,101 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-01 16:25:15,126 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-01 16:25:15,207 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,208 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:25:15,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,289 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:25:15,400 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,406 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,408 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:25:15,411 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:15,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:25:15,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:25:15,477 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:25:16,770 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse2 (store (select .cse11 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))))) is different from false
[2023-11-01 16:25:16,914 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse7 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse2 (store (select .cse11 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2030 (Array Int Int))) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse13 .cse2 (store (select .cse13 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2036))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false
[2023-11-01 16:25:16,995 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:16,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 90
[2023-11-01 16:25:17,020 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:17,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 778 treesize of output 744
[2023-11-01 16:25:17,032 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 788 treesize of output 752
[2023-11-01 16:25:27,415 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:27,416 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 152
[2023-11-01 16:25:27,466 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:25:27,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 90
[2023-11-01 16:25:27,470 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-01 16:25:27,489 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-01 16:25:27,489 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 216
[2023-11-01 16:25:27,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90
[2023-11-01 16:25:27,532 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2023-11-01 16:25:27,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1
[2023-11-01 16:25:27,540 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2023-11-01 16:25:27,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 1
[2023-11-01 16:25:28,452 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2019 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2019))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2020))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2021) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2022 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_2022) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false
[2023-11-01 16:25:28,529 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_2019 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2019))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2020))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_2021) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2022 (Array Int Int))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse3 .cse2 v_ArrVal_2022) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2023-11-01 16:25:28,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-01 16:25:28,533 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375335282] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:25:28,533 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:25:28,533 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-11-01 16:25:28,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666456175]
[2023-11-01 16:25:28,534 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:25:28,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-11-01 16:25:28,534 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:25:28,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-01 16:25:28,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1756, Unknown=42, NotChecked=356, Total=2352
[2023-11-01 16:25:29,018 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-01 16:25:29,021 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 520 transitions, 9131 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:25:29,021 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:25:29,021 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-01 16:25:29,021 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:25:47,202 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-11-01 16:25:54,718 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-11-01 16:25:58,658 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-11-01 16:26:00,797 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-11-01 16:26:02,796 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-11-01 16:26:08,937 INFO  L130       PetriNetUnfolder]: 1113/2759 cut-off events.
[2023-11-01 16:26:08,937 INFO  L131       PetriNetUnfolder]: For 85431/85431 co-relation queries the response was YES.
[2023-11-01 16:26:08,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22850 conditions, 2759 events. 1113/2759 cut-off events. For 85431/85431 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 19213 event pairs, 180 based on Foata normal form. 41/2800 useless extension candidates. Maximal degree in co-relation 22752. Up to 1502 conditions per place. 
[2023-11-01 16:26:08,968 INFO  L137   encePairwiseOnDemand]: 197/220 looper letters, 539 selfloop transitions, 237 changer transitions 0/777 dead transitions.
[2023-11-01 16:26:08,968 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 777 transitions, 13853 flow
[2023-11-01 16:26:08,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-11-01 16:26:08,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-11-01 16:26:08,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1551 transitions.
[2023-11-01 16:26:08,971 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.27115384615384613
[2023-11-01 16:26:08,971 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1551 transitions.
[2023-11-01 16:26:08,971 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1551 transitions.
[2023-11-01 16:26:08,971 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:26:08,971 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1551 transitions.
[2023-11-01 16:26:08,973 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:26:08,977 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:26:08,977 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:26:08,977 INFO  L175             Difference]: Start difference. First operand has 258 places, 520 transitions, 9131 flow. Second operand 26 states and 1551 transitions.
[2023-11-01 16:26:08,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 777 transitions, 13853 flow
[2023-11-01 16:26:09,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 777 transitions, 13537 flow, removed 47 selfloop flow, removed 9 redundant places.
[2023-11-01 16:26:09,354 INFO  L231             Difference]: Finished difference. Result has 287 places, 606 transitions, 11350 flow
[2023-11-01 16:26:09,354 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=8868, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=11350, PETRI_PLACES=287, PETRI_TRANSITIONS=606}
[2023-11-01 16:26:09,354 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 221 predicate places.
[2023-11-01 16:26:09,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 606 transitions, 11350 flow
[2023-11-01 16:26:09,355 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:26:09,355 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:26:09,355 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:26:09,364 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-11-01 16:26:09,556 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-11-01 16:26:09,556 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:26:09,557 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:26:09,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 1167116781, now seen corresponding path program 8 times
[2023-11-01 16:26:09,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:26:09,559 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782406071]
[2023-11-01 16:26:09,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:26:09,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:26:09,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:26:11,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:26:11,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:26:11,121 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782406071]
[2023-11-01 16:26:11,121 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782406071] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:26:11,122 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989258829]
[2023-11-01 16:26:11,122 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:26:11,122 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:26:11,122 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:26:11,124 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:26:11,126 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-01 16:26:11,336 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:26:11,336 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:26:11,338 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-11-01 16:26:11,341 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:26:11,642 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:26:11,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-01 16:26:11,650 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:11,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:26:12,289 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:26:12,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-01 16:26:12,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,299 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2023-11-01 16:26:12,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:26:12,746 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-01 16:26:12,746 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20
[2023-11-01 16:26:12,758 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-11-01 16:26:12,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:26:12,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-01 16:26:12,841 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,842 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-01 16:26:12,866 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:26:12,949 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-11-01 16:26:12,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:12,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:26:13,064 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,065 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-11-01 16:26:13,164 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,166 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,167 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,168 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:26:13,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,310 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,312 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,314 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,315 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:26:13,320 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:26:13,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-01 16:26:13,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:26:13,388 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:26:13,781 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2023-11-01 16:26:13,825 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))))) is different from false
[2023-11-01 16:26:13,875 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) is different from false
[2023-11-01 16:26:13,958 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0)))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store (let ((.cse13 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse14 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse14 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false
[2023-11-01 16:26:14,021 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (store (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store (let ((.cse18 (store (let ((.cse19 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse16 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse16 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2023-11-01 16:26:14,099 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse0 (let ((.cse3 (store (let ((.cse5 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse2) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse2) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse14 .cse1 (store (select .cse14 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse2) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse18 .cse1 (store (select .cse18 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse2) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2023-11-01 16:26:16,384 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_84| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store (let ((.cse5 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| (* |v_ULTIMATE.start_main_~i~1#1_84| 4)) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse9 |v_ULTIMATE.start_main_~i~1#1_84|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_84| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= 0 (select (select (let ((.cse10 (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| (* |v_ULTIMATE.start_main_~i~1#1_84| 4)) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse6))) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)))) (not (<= .cse9 |v_ULTIMATE.start_main_~i~1#1_84|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_84| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)) (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse14 .cse2 (store (select .cse14 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| (* |v_ULTIMATE.start_main_~i~1#1_84| 4)) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (not (<= .cse9 |v_ULTIMATE.start_main_~i~1#1_84|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_84| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2217 Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2208))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2211))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2214))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse18 .cse2 (store (select .cse18 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| (* |v_ULTIMATE.start_main_~i~1#1_84| 4)) v_ArrVal_2217))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_57|)))) (not (<= .cse9 |v_ULTIMATE.start_main_~i~1#1_84|)))))) is different from false
[2023-11-01 16:26:16,612 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:26:16,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 379 treesize of output 260
[2023-11-01 16:26:18,600 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:26:18,616 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89291198 treesize of output 88239816
[2023-11-01 16:29:09,557 WARN  L233               SmtUtils]: Spent 2.85m on a formula simplification that was a NOOP. DAG size: 10125 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-01 16:29:10,252 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88767926 treesize of output 88649398
[2023-11-01 16:32:05,295 WARN  L233               SmtUtils]: Spent 2.92m on a formula simplification that was a NOOP. DAG size: 8551 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-01 16:32:05,811 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98803382 treesize of output 94842550
Killed by 15
