./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:05:24,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:05:25,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:05:25,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:05:25,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:05:25,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:05:25,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:05:25,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:05:25,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:05:25,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:05:25,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:05:25,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:05:25,113 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:05:25,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:05:25,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:05:25,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:05:25,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:05:25,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:05:25,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:05:25,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:05:25,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:05:25,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:05:25,116 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:05:25,117 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:05:25,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:05:25,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:05:25,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:05:25,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:05:25,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:05:25,118 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:05:25,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:05:25,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:05:25,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:05:25,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:05:25,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:05:25,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:05:25,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:05:25,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:05:25,121 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:05:25,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:05:25,121 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:05:25,122 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:05:25,122 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:05:25,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 [2023-11-21 22:05:25,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:05:25,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:05:25,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:05:25,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:05:25,363 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:05:25,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i [2023-11-21 22:05:26,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:05:26,932 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:05:26,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-index-inc.i [2023-11-21 22:05:26,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e04ef5bd6/5757a0933f3f47a7a89c801b94c85d45/FLAG2003ba2a8 [2023-11-21 22:05:26,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e04ef5bd6/5757a0933f3f47a7a89c801b94c85d45 [2023-11-21 22:05:26,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:05:26,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:05:26,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:05:26,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:05:26,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:05:26,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:26" (1/1) ... [2023-11-21 22:05:26,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b01cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:26, skipping insertion in model container [2023-11-21 22:05:26,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:26" (1/1) ... [2023-11-21 22:05:27,049 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:05:27,199 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:05:27,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:05:27,484 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:05:27,507 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:05:27,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:05:27,589 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:05:27,596 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:05:27,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27 WrapperNode [2023-11-21 22:05:27,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:05:27,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:05:27,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:05:27,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:05:27,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,644 INFO L138 Inliner]: procedures = 282, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-11-21 22:05:27,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:05:27,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:05:27,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:05:27,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:05:27,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:05:27,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:05:27,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:05:27,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:05:27,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (1/1) ... [2023-11-21 22:05:27,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:05:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:27,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:05:27,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:05:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:05:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:05:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 22:05:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:05:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:05:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:05:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:05:27,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:05:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:05:27,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:05:27,790 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:05:27,961 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:05:27,963 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:05:28,250 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:05:28,268 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:05:28,268 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:05:28,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:28 BoogieIcfgContainer [2023-11-21 22:05:28,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:05:28,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:05:28,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:05:28,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:05:28,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:05:26" (1/3) ... [2023-11-21 22:05:28,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ab83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:28, skipping insertion in model container [2023-11-21 22:05:28,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:27" (2/3) ... [2023-11-21 22:05:28,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ab83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:28, skipping insertion in model container [2023-11-21 22:05:28,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:28" (3/3) ... [2023-11-21 22:05:28,277 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc.i [2023-11-21 22:05:28,285 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:05:28,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:05:28,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-21 22:05:28,295 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:05:28,365 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:05:28,404 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:05:28,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:05:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:28,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:05:28,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 22:05:28,442 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:05:28,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:05:28,458 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@123c21fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:05:28,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-21 22:05:28,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:28,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2066601285, now seen corresponding path program 1 times [2023-11-21 22:05:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228583350] [2023-11-21 22:05:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:28,883 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-21 22:05:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:28,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228583350] [2023-11-21 22:05:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228583350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:28,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:05:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54439422] [2023-11-21 22:05:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:28,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:05:28,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:05:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:05:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:28,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:28,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-21 22:05:28,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:28,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:05:28,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:28,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1742492828, now seen corresponding path program 1 times [2023-11-21 22:05:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802468848] [2023-11-21 22:05:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:29,129 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-21 22:05:29,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:29,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802468848] [2023-11-21 22:05:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802468848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:05:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869155266] [2023-11-21 22:05:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:29,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:05:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:05:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:05:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,137 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:29,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-21 22:05:29,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:05:29,217 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:29,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 9922377, now seen corresponding path program 1 times [2023-11-21 22:05:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363512273] [2023-11-21 22:05:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:29,301 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-21 22:05:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363512273] [2023-11-21 22:05:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363512273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:29,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:05:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407225189] [2023-11-21 22:05:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:29,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:05:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:05:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:05:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-21 22:05:29,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:05:29,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:29,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 661800941, now seen corresponding path program 1 times [2023-11-21 22:05:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368273726] [2023-11-21 22:05:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:29,445 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-21 22:05:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368273726] [2023-11-21 22:05:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368273726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:05:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420778730] [2023-11-21 22:05:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:29,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:05:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:29,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:05:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:05:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:29,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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-21 22:05:29,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:29,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:05:29,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:29,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2145549144, now seen corresponding path program 1 times [2023-11-21 22:05:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621995593] [2023-11-21 22:05:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:30,218 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-21 22:05:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621995593] [2023-11-21 22:05:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621995593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:30,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:05:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255123850] [2023-11-21 22:05:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:30,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:05:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:05:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:05:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:30,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:30,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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-21 22:05:30,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:30,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:30,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:05:30,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:30,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1185942252, now seen corresponding path program 1 times [2023-11-21 22:05:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055678417] [2023-11-21 22:05:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055678417] [2023-11-21 22:05:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055678417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 22:05:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119600163] [2023-11-21 22:05:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:05:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:05:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:05:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:31,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:31,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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-21 22:05:31,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:31,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:05:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:05:31,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:31,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1913256608, now seen corresponding path program 1 times [2023-11-21 22:05:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90270169] [2023-11-21 22:05:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:32,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90270169] [2023-11-21 22:05:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90270169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230761626] [2023-11-21 22:05:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:32,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:32,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:32,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:32,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:05:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:32,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:05:32,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:32,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:05:32,905 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:32,906 INFO L378 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 15 treesize of output 15 [2023-11-21 22:05:33,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:05:33,107 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:05:33,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:33,249 INFO L378 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 26 treesize of output 19 [2023-11-21 22:05:33,264 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:05:33,311 INFO L378 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-21 22:05:33,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:33,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 42 [2023-11-21 22:05:33,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:05:33,712 INFO L378 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 25 treesize of output 13 [2023-11-21 22:05:33,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:33,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:05:33,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:33,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:05:33,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:33,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:05:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:05:33,906 INFO L378 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 56 treesize of output 45 [2023-11-21 22:05:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:33,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:05:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230761626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:05:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-21 22:05:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207887506] [2023-11-21 22:05:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:33,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 22:05:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:05:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-21 22:05:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:33,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 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-21 22:05:33,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:05:33,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:34,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:05:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:05:34,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:05:35,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-21 22:05:35,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:35,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1456411060, now seen corresponding path program 2 times [2023-11-21 22:05:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815442529] [2023-11-21 22:05:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815442529] [2023-11-21 22:05:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815442529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217557933] [2023-11-21 22:05:36,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:05:36,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:36,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:36,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:36,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:05:36,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:05:36,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:36,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-21 22:05:36,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:36,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:05:36,474 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:36,475 INFO L378 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 15 treesize of output 15 [2023-11-21 22:05:36,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:05:36,880 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:05:37,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,263 INFO L378 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 26 treesize of output 19 [2023-11-21 22:05:37,295 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:05:37,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:05:37,867 INFO L378 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 25 treesize of output 13 [2023-11-21 22:05:37,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:37,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 22:05:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:05:38,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:38,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:38,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:38,181 INFO L378 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 37 treesize of output 26 [2023-11-21 22:05:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:38,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:38,521 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) .cse2))))))) is different from false [2023-11-21 22:05:38,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) .cse0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet8|))))) is different from false [2023-11-21 22:05:38,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) .cse0))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_380) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_385) .cse1 v_ArrVal_386) c_~datas~0.base) (+ c_~datas~0.offset .cse2))))))) is different from false [2023-11-21 22:05:39,136 INFO L378 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 38 treesize of output 24 [2023-11-21 22:05:39,142 INFO L378 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 24 treesize of output 17 [2023-11-21 22:05:39,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,179 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:39,179 INFO L378 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:05:39,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,186 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:39,187 INFO L378 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-21 22:05:39,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:39,193 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:39,193 INFO L378 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:05:39,798 INFO L378 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 92 treesize of output 64 [2023-11-21 22:05:39,809 INFO L378 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 34 treesize of output 30 [2023-11-21 22:05:39,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:39,912 INFO L378 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 35 treesize of output 40 [2023-11-21 22:05:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:39,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217557933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:39,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:39,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 18] total 51 [2023-11-21 22:05:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920036450] [2023-11-21 22:05:39,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:39,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 22:05:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:39,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 22:05:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2061, Unknown=50, NotChecked=288, Total=2652 [2023-11-21 22:05:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:39,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.9411764705882355) internal successors, (252), 52 states have internal predecessors, (252), 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-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:05:39,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:05:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:05:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:05:43,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:05:43,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:43,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:43,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash 560731744, now seen corresponding path program 3 times [2023-11-21 22:05:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:43,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987442824] [2023-11-21 22:05:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987442824] [2023-11-21 22:05:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987442824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939319885] [2023-11-21 22:05:44,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:05:44,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:44,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:44,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:05:44,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:05:44,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:44,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 22:05:44,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:44,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:05:44,981 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:44,981 INFO L378 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 15 treesize of output 15 [2023-11-21 22:05:45,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:05:45,417 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-21 22:05:45,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:45,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 22:05:45,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:45,837 INFO L378 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 16 treesize of output 11 [2023-11-21 22:05:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:45,875 INFO L378 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 26 treesize of output 19 [2023-11-21 22:05:45,900 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:05:46,305 INFO L378 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 7 treesize of output 3 [2023-11-21 22:05:46,316 INFO L378 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 25 treesize of output 13 [2023-11-21 22:05:46,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:46,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 22:05:46,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:05:46,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:05:46,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:46,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:46,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:46,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 22:05:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:46,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:47,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse5)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))))))) is different from false [2023-11-21 22:05:47,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse5 (+ c_~datas~0.offset 2 .cse3)) (.cse7 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|) .cse7 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse7))) (forall ((v_ArrVal_497 Int) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))) is different from false [2023-11-21 22:05:47,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_~datas~0.offset 2 .cse5)) (.cse3 (+ c_~datas~0.offset 3 .cse5))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 v_ArrVal_497))) c_~datas~0.base) .cse3)))))) is different from false [2023-11-21 22:05:47,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_~datas~0.offset 2 .cse6)) (.cse4 (+ c_~datas~0.offset 3 .cse6))) (and (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse6 1)))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_497 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_490) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_496))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_497))) c_~datas~0.base) (+ c_~datas~0.offset .cse6)) |c_threadThread1of1ForFork0_#t~nondet8|))))) is different from false [2023-11-21 22:05:48,256 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2023-11-21 22:05:48,257 INFO L378 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 4 case distinctions, treesize of input 677 treesize of output 637 [2023-11-21 22:05:48,267 INFO L378 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 370 treesize of output 342 [2023-11-21 22:05:48,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:48,284 INFO L378 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 534 treesize of output 494 [2023-11-21 22:05:48,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,473 INFO L349 Elim1Store]: treesize reduction 56, result has 34.9 percent of original size [2023-11-21 22:05:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 240 [2023-11-21 22:05:48,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,483 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 129 [2023-11-21 22:05:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:48,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,532 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 22:05:48,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 300 [2023-11-21 22:05:48,550 INFO L378 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 150 treesize of output 143 [2023-11-21 22:05:48,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 188 treesize of output 170 [2023-11-21 22:05:48,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,608 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 22:05:48,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 292 [2023-11-21 22:05:48,621 INFO L378 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 146 treesize of output 140 [2023-11-21 22:05:48,626 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:48,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 244 treesize of output 218 [2023-11-21 22:05:50,741 INFO L378 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 376 treesize of output 260 [2023-11-21 22:05:50,754 INFO L378 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 314 treesize of output 294 [2023-11-21 22:05:50,765 INFO L378 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 34 treesize of output 30 [2023-11-21 22:05:50,783 INFO L378 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-21 22:05:50,788 INFO L378 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 34 treesize of output 30 [2023-11-21 22:05:50,806 INFO L378 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-21 22:05:50,825 INFO L378 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 34 treesize of output 30 [2023-11-21 22:05:50,840 INFO L378 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 8 treesize of output 6 [2023-11-21 22:05:50,850 INFO L378 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-21 22:05:50,863 INFO L378 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 34 treesize of output 30 [2023-11-21 22:05:51,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:51,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163 [2023-11-21 22:05:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939319885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:51,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 19] total 52 [2023-11-21 22:05:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534326900] [2023-11-21 22:05:51,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:51,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-21 22:05:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-21 22:05:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2092, Unknown=27, NotChecked=388, Total=2756 [2023-11-21 22:05:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:51,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:51,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.846153846153846) internal successors, (252), 53 states have internal predecessors, (252), 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-21 22:05:51,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:05:51,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:05:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:05:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:05:56,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:05:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:56,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:05:56,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1017901236, now seen corresponding path program 4 times [2023-11-21 22:05:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451442020] [2023-11-21 22:05:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:57,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:57,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451442020] [2023-11-21 22:05:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451442020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:57,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866876897] [2023-11-21 22:05:57,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:05:57,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:57,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:57,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:05:57,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:05:57,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:57,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-21 22:05:57,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:57,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:05:58,005 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:58,006 INFO L378 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 15 treesize of output 15 [2023-11-21 22:05:58,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:05:58,394 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-21 22:05:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-21 22:05:58,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,791 INFO L378 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 26 treesize of output 19 [2023-11-21 22:05:58,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:05:58,823 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:59,115 INFO L378 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 7 treesize of output 3 [2023-11-21 22:05:59,127 INFO L378 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 25 treesize of output 13 [2023-11-21 22:05:59,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:59,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:05:59,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:05:59,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:05:59,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:05:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:59,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:59,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:59,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:59,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:59,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:59,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-21 22:05:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:59,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:00,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse8 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse8 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet8|)))))) is different from false [2023-11-21 22:06:00,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse9 (+ c_~datas~0.offset .cse7 1)) (.cse3 (+ c_~datas~0.offset 2 .cse7)) (.cse5 (+ c_~datas~0.offset 3 .cse7))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse9 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7)))) (forall ((v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse9))))))) is different from false [2023-11-21 22:06:00,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem18#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_~datas~0.offset .cse5 1)) (.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse4 (+ c_~datas~0.offset 3 .cse5))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem18#1.base|) .cse1 0))) c_~datas~0.base) .cse4)))))) is different from false [2023-11-21 22:06:00,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_~datas~0.offset 2 .cse8)) (.cse5 (+ c_~datas~0.offset 3 .cse8)) (.cse3 (+ c_~datas~0.offset .cse8 1))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse8)))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 0))) c_~datas~0.base) .cse3)))))) is different from false [2023-11-21 22:06:00,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_~datas~0.offset .cse7 1)) (.cse4 (+ c_~datas~0.offset 2 .cse7)) (.cse5 (+ c_~datas~0.offset 3 .cse7))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 0))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7)) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_609 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_601) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|) .cse5 |c_threadThread1of1ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_609))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 0))) c_~datas~0.base) .cse5)))))) is different from false [2023-11-21 22:06:01,104 INFO L349 Elim1Store]: treesize reduction 25, result has 64.3 percent of original size [2023-11-21 22:06:01,105 INFO L378 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 4 case distinctions, treesize of input 780 treesize of output 752 [2023-11-21 22:06:01,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:01,125 INFO L378 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 526 treesize of output 484 [2023-11-21 22:06:01,132 INFO L378 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 352 treesize of output 324 [2023-11-21 22:06:01,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,241 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-21 22:06:01,242 INFO L378 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 4 case distinctions, treesize of input 237 treesize of output 236 [2023-11-21 22:06:01,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:01,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,251 INFO L378 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 125 treesize of output 109 [2023-11-21 22:06:01,266 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,284 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-21 22:06:01,285 INFO L378 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 4 case distinctions, treesize of input 341 treesize of output 292 [2023-11-21 22:06:01,292 INFO L378 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 157 treesize of output 151 [2023-11-21 22:06:01,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,296 INFO L378 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 178 treesize of output 160 [2023-11-21 22:06:01,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,328 INFO L349 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2023-11-21 22:06:01,329 INFO L378 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 4 case distinctions, treesize of input 237 treesize of output 236 [2023-11-21 22:06:01,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:01,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:01,348 INFO L378 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 125 treesize of output 109 [2023-11-21 22:06:02,740 INFO L378 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 376 treesize of output 260 [2023-11-21 22:06:02,751 INFO L378 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 314 treesize of output 294 [2023-11-21 22:06:02,759 INFO L378 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 8 treesize of output 6 [2023-11-21 22:06:02,765 INFO L378 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 34 treesize of output 30 [2023-11-21 22:06:02,782 INFO L378 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-21 22:06:02,797 INFO L378 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 34 treesize of output 30 [2023-11-21 22:06:02,814 INFO L378 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 34 treesize of output 30 [2023-11-21 22:06:02,830 INFO L378 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-21 22:06:02,837 INFO L378 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 34 treesize of output 30 [2023-11-21 22:06:02,857 INFO L378 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-21 22:06:03,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163 [2023-11-21 22:06:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:06:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866876897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:03,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 47 [2023-11-21 22:06:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009315434] [2023-11-21 22:06:03,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:03,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-21 22:06:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-21 22:06:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1583, Unknown=39, NotChecked=430, Total=2256 [2023-11-21 22:06:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:03,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:03,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.361702127659575) internal successors, (252), 48 states have internal predecessors, (252), 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-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:06:03,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:06:03,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:06:03,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:06:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:06:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:06,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:06,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-21 22:06:06,895 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:06,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1052002144, now seen corresponding path program 5 times [2023-11-21 22:06:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:06,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917876638] [2023-11-21 22:06:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:06,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:07,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917876638] [2023-11-21 22:06:07,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917876638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:07,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216402683] [2023-11-21 22:06:07,754 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:06:07,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:07,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:07,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:06:07,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:06:07,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:07,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-21 22:06:07,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:08,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:06:08,154 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:08,155 INFO L378 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 15 treesize of output 15 [2023-11-21 22:06:08,442 INFO L378 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 7 treesize of output 3 [2023-11-21 22:06:08,547 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:06:08,547 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:06:08,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:08,884 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:09,028 INFO L378 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 25 treesize of output 13 [2023-11-21 22:06:09,072 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:06:09,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:06:09,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:06:09,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:06:09,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:06:09,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:09,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:06:09,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:09,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:06:09,432 INFO L378 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 37 treesize of output 26 [2023-11-21 22:06:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:09,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:09,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_719 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_719 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet8|)))) is different from false [2023-11-21 22:06:09,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet8|)) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false [2023-11-21 22:06:09,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset .cse2 1)) (.cse1 (+ c_~datas~0.offset 2 .cse2)) (.cse4 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet8|) .cse1 |c_threadThread1of1ForFork0_#t~nondet8|) .cse4 |c_threadThread1of1ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet8| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_719) c_~datas~0.base) .cse4))))))) is different from false [2023-11-21 22:06:09,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:09,754 INFO L378 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 54 treesize of output 70 [2023-11-21 22:06:09,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:09,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 167 treesize of output 75 [2023-11-21 22:06:09,769 INFO L378 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 34 treesize of output 27 [2023-11-21 22:06:09,771 INFO L378 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 48 treesize of output 34 [2023-11-21 22:06:09,792 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:09,792 INFO L378 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 4 case distinctions, treesize of input 54 treesize of output 1 [2023-11-21 22:06:09,797 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:09,797 INFO L378 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 4 case distinctions, treesize of input 53 treesize of output 1 [2023-11-21 22:06:09,802 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:09,802 INFO L378 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 4 case distinctions, treesize of input 54 treesize of output 1 [2023-11-21 22:06:10,172 INFO L378 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 92 treesize of output 64 [2023-11-21 22:06:10,187 INFO L378 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 34 treesize of output 30 [2023-11-21 22:06:10,201 INFO L378 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 8 treesize of output 4 [2023-11-21 22:06:10,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:10,267 INFO L378 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 35 treesize of output 40 [2023-11-21 22:06:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216402683] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:10,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 49 [2023-11-21 22:06:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787311001] [2023-11-21 22:06:10,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:10,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:06:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:06:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1896, Unknown=44, NotChecked=276, Total=2450 [2023-11-21 22:06:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:10,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.387755102040816) internal successors, (215), 50 states have internal predecessors, (215), 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-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:06:10,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:10,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:10,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:06:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:06:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:06:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:06:16,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2023-11-21 22:06:16,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-21 22:06:16,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-21 22:06:16,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-21 22:06:16,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-21 22:06:16,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-21 22:06:16,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:16,841 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-11-21 22:06:16,842 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-11-21 22:06:16,845 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:16,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:06:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:16,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:06:16,853 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:06:16,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 22:06:16,853 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@123c21fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:16,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 22:06:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-11-21 22:06:16,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:06:16,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 663518903, now seen corresponding path program 1 times [2023-11-21 22:06:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717674718] [2023-11-21 22:06:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:16,882 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-21 22:06:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717674718] [2023-11-21 22:06:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717674718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265973188] [2023-11-21 22:06:16,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:16,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:06:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:16,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:06:16,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:06:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:16,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-21 22:06:16,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:06:16,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:06:16,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -276997546, now seen corresponding path program 1 times [2023-11-21 22:06:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:16,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223080985] [2023-11-21 22:06:16,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:16,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:16,903 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-21 22:06:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223080985] [2023-11-21 22:06:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223080985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:16,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008552271] [2023-11-21 22:06:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:06:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:06:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:06:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-21 22:06:16,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:06:16,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:06:16,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 67025839, now seen corresponding path program 1 times [2023-11-21 22:06:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452335304] [2023-11-21 22:06:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,071 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-21 22:06:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452335304] [2023-11-21 22:06:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452335304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:06:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160049672] [2023-11-21 22:06:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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-21 22:06:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:17,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:06:17,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:06:17,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -282280213, now seen corresponding path program 1 times [2023-11-21 22:06:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509883263] [2023-11-21 22:06:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:06:17,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:06:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:06:17,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:06:17,235 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:06:17,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 22:06:17,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 22:06:17,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 22:06:17,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-21 22:06:17,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 22:06:17,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 22:06:17,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 22:06:17,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:06:17,241 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 22:06:17,241 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 22:06:17,242 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:06:17,242 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:06:17,260 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:06:17,262 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:17,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:06:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:17,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:06:17,270 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:06:17,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 22:06:17,270 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@123c21fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:17,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-21 22:06:17,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-21 22:06:17,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:17,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -559413359, now seen corresponding path program 1 times [2023-11-21 22:06:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959861697] [2023-11-21 22:06:17,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,349 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-21 22:06:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959861697] [2023-11-21 22:06:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959861697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373922423] [2023-11-21 22:06:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:06:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:06:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:06:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,352 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-21 22:06:17,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:06:17,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:17,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1887141238, now seen corresponding path program 1 times [2023-11-21 22:06:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326288574] [2023-11-21 22:06:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,382 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-21 22:06:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326288574] [2023-11-21 22:06:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326288574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818415170] [2023-11-21 22:06:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:06:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:06:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:06:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-21 22:06:17,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:06:17,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:17,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1315591313, now seen corresponding path program 1 times [2023-11-21 22:06:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677506214] [2023-11-21 22:06:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,435 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-21 22:06:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677506214] [2023-11-21 22:06:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677506214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824748467] [2023-11-21 22:06:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:06:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:06:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:06:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-21 22:06:17,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:06:17,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:17,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1840027091, now seen corresponding path program 1 times [2023-11-21 22:06:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592913894] [2023-11-21 22:06:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,494 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-21 22:06:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592913894] [2023-11-21 22:06:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592913894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919962057] [2023-11-21 22:06:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:06:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:06:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:06:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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-21 22:06:17,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:06:17,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:17,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1432873128, now seen corresponding path program 1 times [2023-11-21 22:06:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079070101] [2023-11-21 22:06:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:17,774 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-21 22:06:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079070101] [2023-11-21 22:06:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079070101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:06:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179453877] [2023-11-21 22:06:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:17,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:17,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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-21 22:06:17,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:17,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:17,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:18,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:06:18,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:18,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash -658336902, now seen corresponding path program 1 times [2023-11-21 22:06:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118842689] [2023-11-21 22:06:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118842689] [2023-11-21 22:06:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118842689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 22:06:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542585927] [2023-11-21 22:06:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:06:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:06:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:06:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:18,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:18,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 22:06:18,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:18,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1387039532, now seen corresponding path program 1 times [2023-11-21 22:06:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207841394] [2023-11-21 22:06:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-21 22:06:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207841394] [2023-11-21 22:06:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207841394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:06:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904183861] [2023-11-21 22:06:19,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:19,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:19,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:19,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:19,241 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-21 22:06:19,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:19,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:19,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:19,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:19,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 22:06:19,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:19,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1956239357, now seen corresponding path program 1 times [2023-11-21 22:06:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975749095] [2023-11-21 22:06:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:06:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975749095] [2023-11-21 22:06:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975749095] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453268719] [2023-11-21 22:06:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:20,662 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:20,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 22:06:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:20,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-21 22:06:20,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:21,021 INFO L378 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-21 22:06:21,051 INFO L378 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 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-21 22:06:21,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:21,095 INFO L378 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 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:06:21,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:21,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:06:21,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,329 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,345 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,360 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,377 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,531 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,545 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,567 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:21,581 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:21,880 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:06:21,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-21 22:06:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:06:21,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:22,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false [2023-11-21 22:06:22,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1188 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1188) c_~datas~0.base) .cse2))))))) is different from false [2023-11-21 22:06:22,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:22,694 INFO L378 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 50 treesize of output 66 [2023-11-21 22:06:22,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:22,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 113 treesize of output 34 [2023-11-21 22:06:22,708 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:22,708 INFO L378 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:06:22,712 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:22,712 INFO L378 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:06:22,716 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:06:22,716 INFO L378 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:06:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 22 not checked. [2023-11-21 22:06:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453268719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:22,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2023-11-21 22:06:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084840447] [2023-11-21 22:06:22,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:22,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 22:06:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 22:06:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1035, Unknown=46, NotChecked=138, Total=1406 [2023-11-21 22:06:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:22,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:22,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 8.324324324324325) internal successors, (308), 38 states have internal predecessors, (308), 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-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:22,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:24,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-21 22:06:24,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:24,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:24,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -178820842, now seen corresponding path program 1 times [2023-11-21 22:06:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246552794] [2023-11-21 22:06:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246552794] [2023-11-21 22:06:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246552794] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905052551] [2023-11-21 22:06:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:25,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:25,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:25,859 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:25,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 22:06:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:26,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-21 22:06:26,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:26,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:06:26,113 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:26,113 INFO L378 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 15 treesize of output 15 [2023-11-21 22:06:26,262 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:06:26,262 INFO L378 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 33 treesize of output 24 [2023-11-21 22:06:26,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:26,361 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:26,371 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:06:26,413 INFO L378 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-21 22:06:26,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:26,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 42 [2023-11-21 22:06:26,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:26,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:06:26,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:26,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:26,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:26,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:26,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:26,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:26,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:26,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:26,903 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:06:26,903 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:06:27,099 INFO L378 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 25 treesize of output 13 [2023-11-21 22:06:27,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:27,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:27,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:27,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:27,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:27,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:27,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:27,228 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:06:27,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:06:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905052551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:27,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:06:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2023-11-21 22:06:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244383794] [2023-11-21 22:06:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:27,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-21 22:06:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 22:06:27,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2023-11-21 22:06:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:27,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:27,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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-21 22:06:27,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:27,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:27,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:27,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:27,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:27,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:27,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:27,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:27,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:31,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:31,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 22:06:31,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:31,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1296075347, now seen corresponding path program 1 times [2023-11-21 22:06:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223508374] [2023-11-21 22:06:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-21 22:06:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223508374] [2023-11-21 22:06:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223508374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:06:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606448779] [2023-11-21 22:06:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:32,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:32,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:32,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:32,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:32,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-21 22:06:32,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:32,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2037277932, now seen corresponding path program 1 times [2023-11-21 22:06:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159486361] [2023-11-21 22:06:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159486361] [2023-11-21 22:06:34,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159486361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035009404] [2023-11-21 22:06:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:34,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:34,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 22:06:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:34,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 22:06:34,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:34,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:06:34,430 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:34,430 INFO L378 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 15 treesize of output 15 [2023-11-21 22:06:34,589 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:06:34,589 INFO L378 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 33 treesize of output 24 [2023-11-21 22:06:34,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:34,803 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:34,823 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:06:34,867 INFO L378 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-21 22:06:34,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 42 [2023-11-21 22:06:34,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:34,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:06:35,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:06:35,439 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:06:35,638 INFO L378 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 25 treesize of output 13 [2023-11-21 22:06:35,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:35,833 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:35,847 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:35,862 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:35,887 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:36,268 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:06:36,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-21 22:06:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:06:36,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:06:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035009404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:06:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 40 [2023-11-21 22:06:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819317080] [2023-11-21 22:06:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-21 22:06:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-21 22:06:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2023-11-21 22:06:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:36,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:36,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.65) internal successors, (133), 21 states have internal predecessors, (133), 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-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:06:37,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:38,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:38,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:38,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2090667868, now seen corresponding path program 1 times [2023-11-21 22:06:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264233276] [2023-11-21 22:06:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264233276] [2023-11-21 22:06:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264233276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551143066] [2023-11-21 22:06:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:39,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:39,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:39,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:39,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 22:06:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:39,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 22:06:39,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:39,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:06:39,997 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:39,997 INFO L378 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 15 treesize of output 15 [2023-11-21 22:06:40,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:06:40,156 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:06:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:40,374 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:40,387 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:06:40,445 INFO L378 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-21 22:06:40,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:40,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 42 [2023-11-21 22:06:40,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:40,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:06:40,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:40,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:40,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:40,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:40,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:40,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:40,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:41,023 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:06:41,023 INFO L378 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 33 treesize of output 24 [2023-11-21 22:06:41,244 INFO L378 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 25 treesize of output 13 [2023-11-21 22:06:41,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:41,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:41,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:41,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:41,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:41,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:41,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:41,467 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:41,485 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:41,500 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:41,837 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:06:41,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-21 22:06:41,849 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:06:41,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:41,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1775 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))))) is different from false [2023-11-21 22:06:41,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~datas~0.base)) (.cse1 (+ c_~datas~0.offset (* c_threadThread2of2ForFork0_~j~0 4))) (.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)))) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 .cse1 |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) is different from false [2023-11-21 22:06:42,046 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~datas~0.base)) (.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))))) (forall ((v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store .cse0 (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-21 22:06:42,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-21 22:06:42,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse2 c_~datas~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) |c_ULTIMATE.start_main_#t~mem18#1.base| v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))))))) is different from false [2023-11-21 22:06:42,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)) (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0))) (forall ((v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse5 c_~datas~0.base (store (select (store .cse5 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-21 22:06:42,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse0 c_~datas~0.base (store (select (store .cse0 .cse1 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse1 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse3 c_~datas~0.base (store (select (store .cse3 .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse5 c_~datas~0.base (store (select (store .cse5 .cse6 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse6 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse7 c_~datas~0.base (store (select (store .cse7 .cse8 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse8 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) is different from false [2023-11-21 22:06:42,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse1 c_~datas~0.base (store (select (store .cse1 .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse4 c_~datas~0.base (store (select (store .cse4 .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse5 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse6 c_~datas~0.base (store (select (store .cse6 .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse7 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770))) (store .cse8 c_~datas~0.base (store (select (store .cse8 .cse9 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|))) .cse9 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse3)))))))))) is different from false [2023-11-21 22:06:43,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse6 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse5 v_ArrVal_1775)) c_~datas~0.base) .cse6))))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse7 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))))))) is different from false [2023-11-21 22:06:43,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse6 (+ c_~datas~0.offset 2 .cse3)) (.cse8 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet8|) .cse8 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse5 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse5 v_ArrVal_1775)) c_~datas~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse7 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse7 v_ArrVal_1775)) c_~datas~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet8|)))))))))) is different from false [2023-11-21 22:06:43,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse7 (+ c_~datas~0.offset .cse3 1)) (.cse5 (+ c_~datas~0.offset 2 .cse3)) (.cse9 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet8|) .cse5 |c_threadThread1of2ForFork0_#t~nondet8|) .cse9 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse2 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse2 v_ArrVal_1775)) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet8|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= (select (select (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse4 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse4 v_ArrVal_1775)) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet8|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse6 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse6 v_ArrVal_1775)) c_~datas~0.base) .cse7))))) (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1770 (Array Int Int)) (v_threadThread2of2ForFork0_~j~0_24 Int)) (or (< v_threadThread2of2ForFork0_~j~0_24 c_~next_j~0) (forall ((|threadThread2of2ForFork0_#t~nondet8| Int) (v_ArrVal_1775 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) c_~datas~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1770) .cse8 v_ArrVal_1773) c_~datas~0.base) (+ (* v_threadThread2of2ForFork0_~j~0_24 4) c_~datas~0.offset) |threadThread2of2ForFork0_#t~nondet8|)) .cse8 v_ArrVal_1775)) c_~datas~0.base) .cse9))))))))))) is different from false [2023-11-21 22:06:43,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,431 INFO L378 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 102 treesize of output 117 [2023-11-21 22:06:43,437 INFO L378 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 272 treesize of output 248 [2023-11-21 22:06:43,442 INFO L378 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 63 treesize of output 56 [2023-11-21 22:06:43,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,448 INFO L378 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 113 treesize of output 58 [2023-11-21 22:06:43,453 INFO L378 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 21 treesize of output 14 [2023-11-21 22:06:43,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,477 INFO L378 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 4 case distinctions, treesize of input 100 treesize of output 115 [2023-11-21 22:06:43,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 183 treesize of output 163 [2023-11-21 22:06:43,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,488 INFO L378 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 129 treesize of output 61 [2023-11-21 22:06:43,493 INFO L378 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 20 treesize of output 14 [2023-11-21 22:06:43,507 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,517 INFO L378 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 4 case distinctions, treesize of input 102 treesize of output 117 [2023-11-21 22:06:43,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 186 treesize of output 166 [2023-11-21 22:06:43,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,529 INFO L378 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 111 treesize of output 49 [2023-11-21 22:06:43,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,546 INFO L378 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 4 case distinctions, treesize of input 102 treesize of output 117 [2023-11-21 22:06:43,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:43,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 186 treesize of output 166 [2023-11-21 22:06:43,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:43,557 INFO L378 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 111 treesize of output 49 [2023-11-21 22:06:43,994 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1756))) (or (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|)))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base))) is different from false [2023-11-21 22:06:44,051 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1755) c_~datas~0.base v_ArrVal_1756))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base))) is different from false [2023-11-21 22:06:44,258 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem15#1.base_20| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1755) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1756))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem15#1.base_20|) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem15#1.base_20| v_ArrVal_1766) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))))) is different from false [2023-11-21 22:06:44,357 INFO L378 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 2761 treesize of output 2141 [2023-11-21 22:06:44,370 INFO L378 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 144 treesize of output 140 [2023-11-21 22:06:44,375 INFO L378 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 143 treesize of output 135 [2023-11-21 22:06:44,393 INFO L378 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 110 treesize of output 102 [2023-11-21 22:06:44,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:44,527 INFO L378 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 34 treesize of output 39 [2023-11-21 22:06:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-11-21 22:06:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551143066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:44,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 24] total 61 [2023-11-21 22:06:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688881296] [2023-11-21 22:06:44,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:44,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-21 22:06:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-21 22:06:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2034, Unknown=34, NotChecked=1470, Total=3782 [2023-11-21 22:06:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:44,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 6.213114754098361) internal successors, (379), 62 states have internal predecessors, (379), 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-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:44,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:06:44,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:06:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:06:48,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-21 22:06:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-21 22:06:48,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:48,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1640465456, now seen corresponding path program 2 times [2023-11-21 22:06:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791980541] [2023-11-21 22:06:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:49,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:49,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791980541] [2023-11-21 22:06:49,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791980541] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376074468] [2023-11-21 22:06:49,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:06:49,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:49,996 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 22:06:50,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:06:50,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:50,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 22:06:50,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:50,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 22:06:50,295 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:06:50,296 INFO L378 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 15 treesize of output 15 [2023-11-21 22:06:50,451 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:06:50,451 INFO L378 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 33 treesize of output 24 [2023-11-21 22:06:50,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:50,669 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:50,686 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:06:50,730 INFO L378 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-21 22:06:50,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:50,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 42 [2023-11-21 22:06:50,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:06:51,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:51,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:51,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:51,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:51,223 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:06:51,224 INFO L378 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 33 treesize of output 24 [2023-11-21 22:06:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,880 INFO L378 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 26 treesize of output 19 [2023-11-21 22:06:51,897 INFO L378 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 25 treesize of output 13 [2023-11-21 22:06:51,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:51,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:51,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:52,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:52,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:52,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:52,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:06:52,105 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:52,120 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:52,136 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:52,151 INFO L378 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 56 treesize of output 45 [2023-11-21 22:06:52,228 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:06:52,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 60 [2023-11-21 22:06:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:06:52,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:06:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376074468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:06:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [22] total 40 [2023-11-21 22:06:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571824700] [2023-11-21 22:06:52,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:52,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-21 22:06:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:52,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-21 22:06:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2023-11-21 22:06:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:52,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:52,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.65) internal successors, (133), 21 states have internal predecessors, (133), 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-21 22:06:52,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:06:52,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 22:06:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:06:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:06:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:06:55,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-21 22:06:55,899 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE, threadErr2ASSERT_VIOLATIONDATA_RACE, threadErr3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2023-11-21 22:06:55,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -465789449, now seen corresponding path program 1 times [2023-11-21 22:06:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324277966] [2023-11-21 22:06:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:06:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324277966] [2023-11-21 22:06:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324277966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856458877] [2023-11-21 22:06:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:57,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:57,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:57,086 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:57,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 22:06:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:57,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:06:57,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:57,430 INFO L378 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-21 22:06:57,453 INFO L378 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 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-21 22:06:57,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:57,486 INFO L378 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 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:06:57,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,610 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,620 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,635 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,648 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,809 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,827 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,842 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:57,852 INFO L378 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 44 treesize of output 35 [2023-11-21 22:06:58,076 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-21 22:06:58,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 56 [2023-11-21 22:06:58,121 INFO L349 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2023-11-21 22:06:58,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 59 [2023-11-21 22:06:58,141 INFO L349 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-11-21 22:06:58,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 68 [2023-11-21 22:06:58,183 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-21 22:06:58,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 71 [2023-11-21 22:07:16,302 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-21 22:07:16,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 83 [2023-11-21 22:07:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:07:17,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:07:18,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet8|)) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet8|)))) is different from false [2023-11-21 22:07:18,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 2 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet8|)) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse2))))))) is different from false [2023-11-21 22:07:18,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse1 (+ c_~datas~0.offset .cse3 1)) (.cse2 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet8|) .cse2 |c_threadThread1of2ForFork0_#t~nondet8|)))) (and (forall ((v_ArrVal_2138 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet8|)) (<= (+ c_threadThread1of2ForFork0_~j~0 1) c_~next_j~0) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_2138 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet8| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2138) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))) is different from false [2023-11-21 22:07:18,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:18,437 INFO L378 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 3 case distinctions, treesize of input 43 treesize of output 54 [2023-11-21 22:07:18,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:18,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 31 [2023-11-21 22:07:18,451 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:07:18,451 INFO L378 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-21 22:07:18,456 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:07:18,456 INFO L378 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:07:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 22 not checked. [2023-11-21 22:07:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856458877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:07:18,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:07:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2023-11-21 22:07:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686745170] [2023-11-21 22:07:18,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:07:18,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-21 22:07:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-21 22:07:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1230, Unknown=13, NotChecked=222, Total=1640 [2023-11-21 22:07:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:18,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:07:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.925) internal successors, (317), 41 states have internal predecessors, (317), 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-21 22:07:18,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:18,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:07:18,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:07:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:07:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:07:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:21,068 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 [0] [2023-11-21 22:07:24,291 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] [2023-11-21 22:07:26,304 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 [0] [2023-11-21 22:07:28,314 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] [2023-11-21 22:07:33,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:35,360 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] [2023-11-21 22:07:37,366 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 [0] [2023-11-21 22:07:38,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:39,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:42,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:44,917 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] [2023-11-21 22:07:46,926 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 [0] [2023-11-21 22:07:48,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:50,530 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] [2023-11-21 22:07:52,533 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] [2023-11-21 22:07:54,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:56,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:07:59,038 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] [2023-11-21 22:08:01,041 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] [2023-11-21 22:08:02,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:08:04,166 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] [2023-11-21 22:08:07,135 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] [2023-11-21 22:08:08,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:08:10,158 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] [2023-11-21 22:08:12,162 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] [2023-11-21 22:08:14,179 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 [0] [2023-11-21 22:08:16,184 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] [2023-11-21 22:08:18,193 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] [2023-11-21 22:08:20,198 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] [2023-11-21 22:08:22,207 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] [2023-11-21 22:08:24,213 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] [2023-11-21 22:08:26,227 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 [0] [2023-11-21 22:08:28,236 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 [0] [2023-11-21 22:08:29,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:08:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:08:32,270 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] [2023-11-21 22:08:34,274 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] [2023-11-21 22:08:36,280 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] [2023-11-21 22:08:38,283 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] [2023-11-21 22:08:40,288 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] [2023-11-21 22:08:42,290 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] [2023-11-21 22:08:44,297 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] [2023-11-21 22:08:47,295 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] [2023-11-21 22:08:49,301 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 [0] [2023-11-21 22:08:51,308 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] [2023-11-21 22:08:53,311 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] [2023-11-21 22:08:55,316 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] [2023-11-21 22:08:57,320 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] [2023-11-21 22:09:00,311 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] [2023-11-21 22:09:02,314 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] [2023-11-21 22:09:04,317 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] [2023-11-21 22:09:05,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:09:07,354 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] [2023-11-21 22:09:09,362 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] [2023-11-21 22:09:11,365 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] [2023-11-21 22:09:15,326 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] [2023-11-21 22:09:17,327 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] [2023-11-21 22:09:19,332 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] [2023-11-21 22:09:22,336 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] [2023-11-21 22:09:24,339 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] [2023-11-21 22:09:27,340 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] Killed by 15