./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 02:47:12,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 02:47:12,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 02:47:12,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 02:47:12,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 02:47:12,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 02:47:12,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 02:47:12,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 02:47:12,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 02:47:12,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 02:47:12,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 02:47:12,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 02:47:12,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 02:47:12,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 02:47:12,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 02:47:12,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 02:47:12,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 02:47:12,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 02:47:12,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 02:47:12,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 02:47:12,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 02:47:12,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 02:47:12,809 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 02:47:12,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 02:47:12,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 02:47:12,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 02:47:12,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 02:47:12,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 02:47:12,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 02:47:12,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 02:47:12,811 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 02:47:12,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 02:47:12,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 02:47:12,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 02:47:12,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 02:47:12,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 02:47:12,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 02:47:12,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 02:47:12,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 02:47:12,816 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 02:47:12,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 02:47:12,817 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 02:47:12,817 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 02:47:12,818 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2024-10-26 02:47:13,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 02:47:13,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 02:47:13,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 02:47:13,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 02:47:13,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 02:47:13,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-10-26 02:47:14,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 02:47:14,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 02:47:14,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-10-26 02:47:14,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c61afa0ae/4450daa1ed3d4fcdadf34a74e5fba007/FLAG96258a231 [2024-10-26 02:47:14,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c61afa0ae/4450daa1ed3d4fcdadf34a74e5fba007 [2024-10-26 02:47:14,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 02:47:14,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 02:47:14,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 02:47:14,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 02:47:14,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 02:47:14,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 02:47:14" (1/1) ... [2024-10-26 02:47:14,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd106e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:14, skipping insertion in model container [2024-10-26 02:47:14,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 02:47:14" (1/1) ... [2024-10-26 02:47:14,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 02:47:15,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 02:47:15,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 02:47:15,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 02:47:15,408 INFO L204 MainTranslator]: Completed translation [2024-10-26 02:47:15,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15 WrapperNode [2024-10-26 02:47:15,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 02:47:15,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 02:47:15,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 02:47:15,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 02:47:15,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,473 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-10-26 02:47:15,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 02:47:15,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 02:47:15,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 02:47:15,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 02:47:15,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 02:47:15,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 02:47:15,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 02:47:15,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 02:47:15,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (1/1) ... [2024-10-26 02:47:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 02:47:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:15,579 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) [2024-10-26 02:47:15,582 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 [2024-10-26 02:47:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 02:47:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 02:47:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 02:47:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 02:47:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 02:47:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 02:47:15,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 02:47:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 02:47:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 02:47:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 02:47:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 02:47:15,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 02:47:15,638 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 02:47:15,792 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 02:47:15,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 02:47:16,173 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 02:47:16,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 02:47:16,216 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 02:47:16,218 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-26 02:47:16,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 02:47:16 BoogieIcfgContainer [2024-10-26 02:47:16,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 02:47:16,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 02:47:16,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 02:47:16,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 02:47:16,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 02:47:14" (1/3) ... [2024-10-26 02:47:16,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dc99fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 02:47:16, skipping insertion in model container [2024-10-26 02:47:16,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 02:47:15" (2/3) ... [2024-10-26 02:47:16,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dc99fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 02:47:16, skipping insertion in model container [2024-10-26 02:47:16,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 02:47:16" (3/3) ... [2024-10-26 02:47:16,229 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-10-26 02:47:16,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 02:47:16,248 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-26 02:47:16,248 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 02:47:16,344 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 02:47:16,403 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:16,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:47:16,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:16,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) [2024-10-26 02:47:16,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 [2024-10-26 02:47:16,459 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:47:16,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 02:47:16,477 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:16,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:47:16,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1545271853, now seen corresponding path program 1 times [2024-10-26 02:47:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936756188] [2024-10-26 02:47:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936756188] [2024-10-26 02:47:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936756188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 02:47:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288926295] [2024-10-26 02:47:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:17,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 02:47:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 02:47:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 02:47:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:17,370 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:17,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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) [2024-10-26 02:47:17,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 02:47:17,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 770082283, now seen corresponding path program 1 times [2024-10-26 02:47:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748270884] [2024-10-26 02:47:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748270884] [2024-10-26 02:47:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748270884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923552793] [2024-10-26 02:47:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:18,381 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:18,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-10-26 02:47:18,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:18,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:18,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 02:47:18,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1766570252, now seen corresponding path program 1 times [2024-10-26 02:47:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477855129] [2024-10-26 02:47:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477855129] [2024-10-26 02:47:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477855129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609500855] [2024-10-26 02:47:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:19,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:19,537 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 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) [2024-10-26 02:47:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:20,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-26 02:47:20,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:20,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash -585089007, now seen corresponding path program 1 times [2024-10-26 02:47:20,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833262715] [2024-10-26 02:47:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:20,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833262715] [2024-10-26 02:47:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833262715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129759273] [2024-10-26 02:47:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:20,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:20,854 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:20,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 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) [2024-10-26 02:47:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:20,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 02:47:21,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash -754015390, now seen corresponding path program 1 times [2024-10-26 02:47:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851506590] [2024-10-26 02:47:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851506590] [2024-10-26 02:47:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851506590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:47:22,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911329906] [2024-10-26 02:47:22,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:22,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:22,086 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) [2024-10-26 02:47:22,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 02:47:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:22,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-26 02:47:22,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:47:22,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:47:22,567 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 11 treesize of output 11 [2024-10-26 02:47:22,782 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 11 treesize of output 7 [2024-10-26 02:47:22,815 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 21 treesize of output 20 [2024-10-26 02:47:22,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:22,861 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 30 treesize of output 32 [2024-10-26 02:47:22,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:22,916 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 39 treesize of output 44 [2024-10-26 02:47:23,116 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 43 treesize of output 32 [2024-10-26 02:47:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:23,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:47:23,185 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ 3 c_t_funThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_408 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) |c_t_funThread1of1ForFork0_#t~nondet12|))) is different from false [2024-10-26 02:47:23,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse1 |c_t_funThread1of1ForFork0_#t~nondet12|)))) (and (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_408 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) |c_t_funThread1of1ForFork0_#t~nondet12|)) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset))))))) is different from false [2024-10-26 02:47:23,346 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) (.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse2 |c_t_funThread1of1ForFork0_#t~nondet12|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet12|)))) (and (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_408 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) .cse2) |c_t_funThread1of1ForFork0_#t~nondet12|)) (forall ((v_ArrVal_408 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_408) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset)))))) is different from false [2024-10-26 02:47:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 02:47:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911329906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:47:25,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:47:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:47:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456477559] [2024-10-26 02:47:25,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:47:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:47:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:47:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=302, Unknown=3, NotChecked=114, Total=506 [2024-10-26 02:47:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:25,494 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:25,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 13.318181818181818) internal successors, (293), 23 states have internal predecessors, (293), 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) [2024-10-26 02:47:25,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:25,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:25,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:25,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:25,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:27,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 02:47:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:27,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 775585945, now seen corresponding path program 1 times [2024-10-26 02:47:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323182228] [2024-10-26 02:47:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323182228] [2024-10-26 02:47:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323182228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:47:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41628894] [2024-10-26 02:47:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:27,746 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) [2024-10-26 02:47:27,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 02:47:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:27,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 02:47:27,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:47:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:28,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:47:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:28,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41628894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:47:28,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:47:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 02:47:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088022682] [2024-10-26 02:47:28,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:47:28,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 02:47:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 02:47:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 02:47:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:28,108 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.3) internal successors, (263), 10 states have internal predecessors, (263), 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) [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:28,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:29,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-26 02:47:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:29,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1417556424, now seen corresponding path program 1 times [2024-10-26 02:47:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339682913] [2024-10-26 02:47:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339682913] [2024-10-26 02:47:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339682913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:47:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730333816] [2024-10-26 02:47:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:30,450 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) [2024-10-26 02:47:30,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-26 02:47:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:30,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-26 02:47:30,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:47:30,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:47:30,816 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 11 treesize of output 11 [2024-10-26 02:47:30,949 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 11 treesize of output 7 [2024-10-26 02:47:30,972 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 21 treesize of output 20 [2024-10-26 02:47:31,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:31,004 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 30 treesize of output 32 [2024-10-26 02:47:31,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:31,045 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 39 treesize of output 44 [2024-10-26 02:47:31,176 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 43 treesize of output 32 [2024-10-26 02:47:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:31,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:47:31,228 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ 3 c_t_funThread1of1ForFork0_~p~0.offset)) 0))) is different from false [2024-10-26 02:47:31,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse1 0)))) (and (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) .cse1) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) 0))))) is different from false [2024-10-26 02:47:31,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) (.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) .cse1) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_733 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_733) c_t_funThread1of1ForFork0_~p~0.base) .cse2) 0))))) is different from false [2024-10-26 02:47:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 02:47:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730333816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:47:33,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:47:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:47:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504038316] [2024-10-26 02:47:33,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:47:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:47:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:47:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=302, Unknown=3, NotChecked=114, Total=506 [2024-10-26 02:47:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:33,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:33,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 12.590909090909092) internal successors, (277), 23 states have internal predecessors, (277), 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) [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:33,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:34,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-26 02:47:34,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:34,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:34,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -564949477, now seen corresponding path program 1 times [2024-10-26 02:47:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:34,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298780013] [2024-10-26 02:47:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298780013] [2024-10-26 02:47:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298780013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:47:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520956031] [2024-10-26 02:47:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:35,430 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) [2024-10-26 02:47:35,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-26 02:47:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:35,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-26 02:47:35,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:47:35,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:47:35,777 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 11 treesize of output 11 [2024-10-26 02:47:35,869 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 11 treesize of output 7 [2024-10-26 02:47:35,892 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 21 treesize of output 20 [2024-10-26 02:47:35,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:35,959 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 30 treesize of output 32 [2024-10-26 02:47:36,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:36,002 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 39 treesize of output 44 [2024-10-26 02:47:36,134 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 43 treesize of output 32 [2024-10-26 02:47:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:36,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:47:36,185 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet7| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_864 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet7| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))))) is different from false [2024-10-26 02:47:36,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse1 |c_t_funThread1of1ForFork0_#t~nondet7|)))) (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) .cse1) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) |c_t_funThread1of1ForFork0_#t~nondet7|))))) is different from false [2024-10-26 02:47:36,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_t_funThread1of1ForFork0_~p~0.offset)) (.cse1 (+ 3 c_t_funThread1of1ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of1ForFork0_~p~0.base) .cse2 |c_t_funThread1of1ForFork0_#t~nondet7|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet7|)))) (and (forall ((v_ArrVal_864 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) c_t_funThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_864 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) (+ c_t_funThread1of1ForFork0_~p~0.offset 1)) |c_t_funThread1of1ForFork0_#t~nondet7|)) (forall ((v_ArrVal_864 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_864) c_t_funThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false [2024-10-26 02:47:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 02:47:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520956031] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:47:38,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:47:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:47:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880841281] [2024-10-26 02:47:38,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:47:38,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:47:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:47:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=302, Unknown=3, NotChecked=114, Total=506 [2024-10-26 02:47:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:38,235 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 11.318181818181818) internal successors, (249), 23 states have internal predecessors, (249), 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) [2024-10-26 02:47:38,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:38,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:38,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:38,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:40,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2024-10-26 02:47:40,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2024-10-26 02:47:40,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2024-10-26 02:47:40,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2024-10-26 02:47:40,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 02:47:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-26 02:47:40,326 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 02:47:40,328 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE (1/2) [2024-10-26 02:47:40,332 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:47:40,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:40,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 02:47:40,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-26 02:47:40,342 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:47:40,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 02:47:40,343 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:40,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:47:40,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:47:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1190862045, now seen corresponding path program 1 times [2024-10-26 02:47:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194795582] [2024-10-26 02:47:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:40,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:40,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194795582] [2024-10-26 02:47:40,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194795582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:40,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:40,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:40,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089347011] [2024-10-26 02:47:40,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:40,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:40,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:40,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:40,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:40,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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) [2024-10-26 02:47:40,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 02:47:40,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:47:40,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1722305356, now seen corresponding path program 1 times [2024-10-26 02:47:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58245854] [2024-10-26 02:47:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:47:40,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 02:47:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:47:40,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 02:47:40,937 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 02:47:40,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-26 02:47:40,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2024-10-26 02:47:40,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2024-10-26 02:47:40,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2024-10-26 02:47:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 02:47:40,943 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 02:47:40,944 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-26 02:47:40,944 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 02:47:40,946 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 02:47:41,008 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 02:47:41,015 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:47:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:41,017 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) [2024-10-26 02:47:41,023 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 [2024-10-26 02:47:41,026 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:47:41,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-26 02:47:41,027 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:47:41,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:47:42,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -719212535, now seen corresponding path program 1 times [2024-10-26 02:47:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871181036] [2024-10-26 02:47:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871181036] [2024-10-26 02:47:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871181036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 02:47:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642482530] [2024-10-26 02:47:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:42,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 02:47:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 02:47:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 02:47:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:42,973 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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) [2024-10-26 02:47:42,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-26 02:47:43,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:43,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1805413035, now seen corresponding path program 1 times [2024-10-26 02:47:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037304183] [2024-10-26 02:47:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037304183] [2024-10-26 02:47:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037304183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372671802] [2024-10-26 02:47:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:43,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,406 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:43,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-10-26 02:47:43,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-26 02:47:43,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 668039604, now seen corresponding path program 1 times [2024-10-26 02:47:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832826548] [2024-10-26 02:47:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832826548] [2024-10-26 02:47:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832826548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966499659] [2024-10-26 02:47:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:44,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:44,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:44,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 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) [2024-10-26 02:47:44,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:44,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:44,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-26 02:47:44,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 687888721, now seen corresponding path program 1 times [2024-10-26 02:47:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958838950] [2024-10-26 02:47:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958838950] [2024-10-26 02:47:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958838950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:47:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267317878] [2024-10-26 02:47:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:45,239 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 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) [2024-10-26 02:47:45,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:45,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:45,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:45,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-26 02:47:48,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:48,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1235179842, now seen corresponding path program 1 times [2024-10-26 02:47:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947024675] [2024-10-26 02:47:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947024675] [2024-10-26 02:47:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947024675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:47:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143422218] [2024-10-26 02:47:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:47:49,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 02:47:49,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-26 02:47:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:49,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-26 02:47:49,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:47:49,610 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:47:49,611 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 11 treesize of output 11 [2024-10-26 02:47:49,727 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 11 treesize of output 7 [2024-10-26 02:47:49,744 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 21 treesize of output 20 [2024-10-26 02:47:49,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:49,768 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 30 treesize of output 32 [2024-10-26 02:47:49,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:47:49,797 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 39 treesize of output 44 [2024-10-26 02:47:49,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 43 treesize of output 32 [2024-10-26 02:47:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:47:49,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:47:49,946 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ 3 c_t_funThread1of2ForFork0_~p~0.offset)) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet12| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) |c_t_funThread1of2ForFork0_#t~nondet12|))) is different from false [2024-10-26 02:47:50,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse1 |c_t_funThread1of2ForFork0_#t~nondet12|)))) (and (forall ((v_ArrVal_1355 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) |c_t_funThread1of2ForFork0_#t~nondet12|))))) is different from false [2024-10-26 02:47:50,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse2 |c_t_funThread1of2ForFork0_#t~nondet12|) .cse1 |c_t_funThread1of2ForFork0_#t~nondet12|)))) (and (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) .cse1) |c_t_funThread1of2ForFork0_#t~nondet12|)) (forall ((v_ArrVal_1355 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet12| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1355) c_t_funThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2024-10-26 02:47:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 02:47:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143422218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:47:52,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:47:52,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:47:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533295983] [2024-10-26 02:47:52,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:47:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:47:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:52,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:47:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=302, Unknown=3, NotChecked=114, Total=506 [2024-10-26 02:47:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:52,079 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:52,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 13.318181818181818) internal successors, (293), 23 states have internal predecessors, (293), 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) [2024-10-26 02:47:52,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:52,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:52,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:52,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:52,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:56,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-26 02:47:56,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:47:56,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash 998362438, now seen corresponding path program 1 times [2024-10-26 02:47:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373800072] [2024-10-26 02:47:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:47:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-26 02:47:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:47:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373800072] [2024-10-26 02:47:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373800072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:47:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:47:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 02:47:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151084871] [2024-10-26 02:47:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:47:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:47:56,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:47:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:47:56,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:47:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:56,643 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:47:56,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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) [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:56,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:47:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:47:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:47:59,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-26 02:47:59,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:47:59,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:47:59,811 INFO L85 PathProgramCache]: Analyzing trace with hash 369196507, now seen corresponding path program 1 times [2024-10-26 02:47:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:47:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639092505] [2024-10-26 02:47:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:47:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:47:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 02:48:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:48:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639092505] [2024-10-26 02:48:00,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639092505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:48:00,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436735370] [2024-10-26 02:48:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:00,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:48:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:00,049 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) [2024-10-26 02:48:00,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-26 02:48:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:00,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-26 02:48:00,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:48:00,505 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 11 treesize of output 7 [2024-10-26 02:48:00,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 02:48:00,693 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 [2024-10-26 02:48:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 02:48:00,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 02:48:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436735370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:48:00,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 02:48:00,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-26 02:48:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874495086] [2024-10-26 02:48:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:48:00,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:48:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:48:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:48:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-26 02:48:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:00,708 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:48:00,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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) [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:00,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:48:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 02:48:02,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-26 02:48:03,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 02:48:03,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:48:03,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:03,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2069806300, now seen corresponding path program 1 times [2024-10-26 02:48:03,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:03,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881223173] [2024-10-26 02:48:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:03,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:48:03,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881223173] [2024-10-26 02:48:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881223173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:48:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673316799] [2024-10-26 02:48:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:03,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:48:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:03,801 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) [2024-10-26 02:48:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-26 02:48:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:04,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-26 02:48:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:48:04,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:48:04,216 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 11 treesize of output 11 [2024-10-26 02:48:04,350 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 11 treesize of output 7 [2024-10-26 02:48:04,376 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 21 treesize of output 20 [2024-10-26 02:48:04,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:48:04,408 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 30 treesize of output 32 [2024-10-26 02:48:04,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:48:04,447 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 39 treesize of output 44 [2024-10-26 02:48:04,561 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 43 treesize of output 32 [2024-10-26 02:48:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:04,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:48:06,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) .cse1) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) 0))))) is different from false [2024-10-26 02:48:06,624 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1831 (Array Int Int))) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) .cse2) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) 0))))) is different from false [2024-10-26 02:48:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673316799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:48:08,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:48:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:48:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902042715] [2024-10-26 02:48:08,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:48:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:48:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:48:08,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:48:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=329, Unknown=10, NotChecked=78, Total=506 [2024-10-26 02:48:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:08,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:48:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 12.590909090909092) internal successors, (277), 23 states have internal predecessors, (277), 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) [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 02:48:08,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 02:48:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:17,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-26 02:48:17,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-26 02:48:17,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:48:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1640835063, now seen corresponding path program 1 times [2024-10-26 02:48:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289299358] [2024-10-26 02:48:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:48:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289299358] [2024-10-26 02:48:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289299358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 02:48:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688060486] [2024-10-26 02:48:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:48:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:18,288 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) [2024-10-26 02:48:18,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-26 02:48:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:18,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-26 02:48:18,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 02:48:18,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 02:48:18,656 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 11 treesize of output 11 [2024-10-26 02:48:18,720 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 11 treesize of output 7 [2024-10-26 02:48:18,737 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 21 treesize of output 20 [2024-10-26 02:48:18,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:48:18,760 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 30 treesize of output 32 [2024-10-26 02:48:18,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 02:48:18,788 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 39 treesize of output 44 [2024-10-26 02:48:18,886 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 43 treesize of output 32 [2024-10-26 02:48:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:18,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 02:48:18,925 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))))) is different from false [2024-10-26 02:48:18,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse1 |c_t_funThread1of2ForFork0_#t~nondet7|)))) (and (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) .cse1) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset)))))) is different from false [2024-10-26 02:48:18,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_t_funThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_t_funThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_t_funThread1of2ForFork0_~p~0.base) .cse1 |c_t_funThread1of2ForFork0_#t~nondet7|) .cse2 |c_t_funThread1of2ForFork0_#t~nondet7|)))) (and (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) .cse1) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) (+ c_t_funThread1of2ForFork0_~p~0.offset 1)) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) .cse2) |c_t_funThread1of2ForFork0_#t~nondet7|)) (forall ((v_ArrVal_1961 (Array Int Int))) (= |c_t_funThread1of2ForFork0_#t~nondet7| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1961) c_t_funThread1of2ForFork0_~p~0.base) c_t_funThread1of2ForFork0_~p~0.offset)))))) is different from false [2024-10-26 02:48:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 02:48:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688060486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 02:48:21,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 02:48:21,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-26 02:48:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102577224] [2024-10-26 02:48:21,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 02:48:21,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-26 02:48:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:48:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-26 02:48:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=302, Unknown=3, NotChecked=114, Total=506 [2024-10-26 02:48:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:21,011 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:48:21,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 11.318181818181818) internal successors, (249), 23 states have internal predecessors, (249), 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) [2024-10-26 02:48:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:21,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 02:48:26,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2024-10-26 02:48:26,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2024-10-26 02:48:26,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2024-10-26 02:48:26,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2024-10-26 02:48:26,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-26 02:48:27,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 02:48:27,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 02:48:27,012 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE,SAFE,SAFE,SAFE (1/3) [2024-10-26 02:48:27,016 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:27,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:48:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:27,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 02:48:27,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-26 02:48:27,024 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:48:27,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 02:48:27,025 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:27,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:48:27,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:48:27,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1347064157, now seen corresponding path program 1 times [2024-10-26 02:48:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978258738] [2024-10-26 02:48:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:48:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978258738] [2024-10-26 02:48:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978258738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:48:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:48:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:48:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931498108] [2024-10-26 02:48:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:48:27,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:48:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:48:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:48:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:48:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:27,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:48:27,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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) [2024-10-26 02:48:27,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:27,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 02:48:27,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:48:27,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1434083705, now seen corresponding path program 1 times [2024-10-26 02:48:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90489856] [2024-10-26 02:48:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:48:27,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 02:48:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:48:27,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 02:48:27,721 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 02:48:27,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-26 02:48:27,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2024-10-26 02:48:27,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2024-10-26 02:48:27,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2024-10-26 02:48:27,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-26 02:48:27,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 02:48:27,725 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-10-26 02:48:27,725 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 02:48:27,726 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-26 02:48:27,761 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-26 02:48:27,766 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:48:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:27,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 02:48:27,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-10-26 02:48:27,772 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:48:27,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 02:48:27,773 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:27,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:48:27,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:48:27,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 186494013, now seen corresponding path program 1 times [2024-10-26 02:48:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965499962] [2024-10-26 02:48:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:48:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 02:48:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:48:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965499962] [2024-10-26 02:48:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965499962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:48:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:48:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:48:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704372858] [2024-10-26 02:48:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:48:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:48:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:48:28,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:48:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:48:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:28,093 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:48:28,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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) [2024-10-26 02:48:28,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:48:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:48:28,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 02:48:28,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2024-10-26 02:48:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:48:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash 78727716, now seen corresponding path program 1 times [2024-10-26 02:48:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:48:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254740152] [2024-10-26 02:48:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:48:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:48:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:48:28,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 02:48:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 02:48:28,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 02:48:28,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 02:48:28,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-26 02:48:28,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2024-10-26 02:48:28,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2024-10-26 02:48:28,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2024-10-26 02:48:28,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-26 02:48:28,390 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 02:48:28,390 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-10-26 02:48:28,390 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 02:48:28,391 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-26 02:48:28,422 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-26 02:48:28,427 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 02:48:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 02:48:28,429 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 02:48:28,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-26 02:48:28,433 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 02:48:28,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-26 02:48:28,434 INFO L333 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, 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;@1534bdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 02:48:28,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-26 02:54:01,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:54:01,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:54:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1731804242, now seen corresponding path program 1 times [2024-10-26 02:54:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:54:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252113664] [2024-10-26 02:54:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:54:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:54:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:54:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 02:54:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:54:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252113664] [2024-10-26 02:54:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252113664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:54:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:54:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 02:54:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421531129] [2024-10-26 02:54:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:54:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-26 02:54:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:54:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-26 02:54:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-26 02:54:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:01,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:54:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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) [2024-10-26 02:54:01,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-26 02:54:02,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:54:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:54:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash 387275413, now seen corresponding path program 1 times [2024-10-26 02:54:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:54:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328426451] [2024-10-26 02:54:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:54:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:54:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:54:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 02:54:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:54:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328426451] [2024-10-26 02:54:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328426451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:54:02,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:54:02,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:54:02,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500126192] [2024-10-26 02:54:02,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:54:02,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:54:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:54:02,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:54:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:54:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:02,387 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:54:02,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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) [2024-10-26 02:54:02,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:02,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:03,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 02:54:03,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:54:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:54:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1932670750, now seen corresponding path program 1 times [2024-10-26 02:54:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:54:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686495798] [2024-10-26 02:54:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:54:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:54:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:54:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 02:54:04,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:54:04,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686495798] [2024-10-26 02:54:04,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686495798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:54:04,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:54:04,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:54:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638758972] [2024-10-26 02:54:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:54:04,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:54:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:54:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:54:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:54:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:04,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:54:04,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.4) internal successors, (122), 6 states have internal predecessors, (122), 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) [2024-10-26 02:54:04,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:04,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:04,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 02:54:05,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE] === [2024-10-26 02:54:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 02:54:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash -942526501, now seen corresponding path program 1 times [2024-10-26 02:54:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 02:54:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625497572] [2024-10-26 02:54:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 02:54:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 02:54:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 02:54:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 02:54:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 02:54:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625497572] [2024-10-26 02:54:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625497572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 02:54:05,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 02:54:05,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 02:54:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134995702] [2024-10-26 02:54:05,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 02:54:05,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 02:54:05,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 02:54:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 02:54:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 02:54:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:05,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 02:54:05,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 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) [2024-10-26 02:54:05,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 02:54:05,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:05,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 02:54:05,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15