./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_81-list_racing.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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 06:18:58,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:18:58,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:18:58,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:18:58,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:18:58,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:18:58,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:18:58,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:18:58,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:18:58,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:18:58,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:18:58,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:18:58,583 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:18:58,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:18:58,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:18:58,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:18:58,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:18:58,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:18:58,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:18:58,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:18:58,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:18:58,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:18:58,590 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:18:58,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:18:58,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:18:58,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:18:58,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:18:58,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:18:58,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:18:58,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:18:58,592 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:18:58,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:18:58,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:18:58,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:18:58,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:18:58,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:18:58,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:18:58,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:18:58,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:18:58,599 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:18:58,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:18:58,600 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:18:58,600 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:18:58,600 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2024-11-13 06:18:58,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:18:58,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:18:58,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:18:58,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:18:58,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:18:58,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2024-11-13 06:19:00,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:19:00,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:19:00,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2024-11-13 06:19:00,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6b74daedf/dc8659bea7c349b9bf11d5ca3a0723ae/FLAG906ed0381 [2024-11-13 06:19:00,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6b74daedf/dc8659bea7c349b9bf11d5ca3a0723ae [2024-11-13 06:19:00,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:19:00,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:19:01,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:19:01,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:19:01,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:19:01,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:19:00" (1/1) ... [2024-11-13 06:19:01,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6846e296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01, skipping insertion in model container [2024-11-13 06:19:01,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:19:00" (1/1) ... [2024-11-13 06:19:01,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:19:01,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:19:01,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:19:01,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:19:01,799 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:19:01,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01 WrapperNode [2024-11-13 06:19:01,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:19:01,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:19:01,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:19:01,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:19:01,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,873 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 384 [2024-11-13 06:19:01,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:19:01,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:19:01,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:19:01,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:19:01,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:19:01,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:19:01,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:19:01,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:19:01,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (1/1) ... [2024-11-13 06:19:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:19:01,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:01,975 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-11-13 06:19:01,978 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-11-13 06:19:02,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 06:19:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 06:19:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2024-11-13 06:19:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2024-11-13 06:19:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:19:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 06:19:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:19:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-11-13 06:19:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-11-13 06:19:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 06:19:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:19:02,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:19:02,035 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:19:02,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:19:02,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:19:02,917 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:19:02,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:19:02,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:19:02,982 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-13 06:19:02,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:19:02 BoogieIcfgContainer [2024-11-13 06:19:02,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:19:02,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:19:02,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:19:02,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:19:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:19:00" (1/3) ... [2024-11-13 06:19:02,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a57e542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:19:02, skipping insertion in model container [2024-11-13 06:19:02,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:19:01" (2/3) ... [2024-11-13 06:19:02,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a57e542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:19:02, skipping insertion in model container [2024-11-13 06:19:02,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:19:02" (3/3) ... [2024-11-13 06:19:02,993 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2024-11-13 06:19:03,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:19:03,013 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-13 06:19:03,013 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:19:03,174 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-13 06:19:03,257 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:03,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:19:03,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:03,261 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-11-13 06:19:03,263 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-11-13 06:19:03,298 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:19:03,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2024-11-13 06:19:03,318 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:03,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 06:19:07,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:19:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1016212406, now seen corresponding path program 1 times [2024-11-13 06:19:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216671188] [2024-11-13 06:19:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:08,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216671188] [2024-11-13 06:19:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216671188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882454058] [2024-11-13 06:19:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:08,607 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-11-13 06:19:08,608 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-11-13 06:19:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:08,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 06:19:08,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:19:08,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:19:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882454058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:19:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-13 06:19:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979527945] [2024-11-13 06:19:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:19:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:19:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:08,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:08,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.0) internal successors, (144), 3 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-11-13 06:19:08,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:09,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 06:19:09,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-13 06:19:09,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:19:09,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1783862925, now seen corresponding path program 1 times [2024-11-13 06:19:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204369746] [2024-11-13 06:19:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204369746] [2024-11-13 06:19:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204369746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437497590] [2024-11-13 06:19:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:09,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:09,762 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-11-13 06:19:09,763 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-11-13 06:19:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:09,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:19:09,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:09,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437497590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:10,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:19:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264653329] [2024-11-13 06:19:10,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:10,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:19:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:19:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:19:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:10,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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-11-13 06:19:10,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:10,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:12,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-11-13 06:19:12,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-13 06:19:12,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-13 06:19:12,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 06:19:12,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:12,653 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 06:19:12,655 INFO L317 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2024-11-13 06:19:12,665 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:12,667 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:19:12,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork0 ======== [2024-11-13 06:19:12,668 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:12,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-13 06:19:12,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:12,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1742789173, now seen corresponding path program 1 times [2024-11-13 06:19:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319551865] [2024-11-13 06:19:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:13,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:13,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319551865] [2024-11-13 06:19:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319551865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:13,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800164480] [2024-11-13 06:19:13,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:13,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:13,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:13,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:13,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.4) internal successors, (137), 6 states have internal predecessors, (137), 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-11-13 06:19:13,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:13,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 06:19:13,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:13,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1920420410, now seen corresponding path program 1 times [2024-11-13 06:19:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122997093] [2024-11-13 06:19:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122997093] [2024-11-13 06:19:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122997093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349946011] [2024-11-13 06:19:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:14,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:14,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:14,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.0) internal successors, (145), 6 states have internal predecessors, (145), 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-11-13 06:19:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:14,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:14,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 06:19:14,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:14,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1798511116, now seen corresponding path program 1 times [2024-11-13 06:19:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:14,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701210651] [2024-11-13 06:19:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701210651] [2024-11-13 06:19:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701210651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:19:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149254452] [2024-11-13 06:19:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:19:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:19:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:19:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:14,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:14,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 75.0) internal successors, (150), 3 states have internal predecessors, (150), 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-11-13 06:19:14,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:14,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:14,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 06:19:15,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 356209363, now seen corresponding path program 1 times [2024-11-13 06:19:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839682455] [2024-11-13 06:19:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:15,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839682455] [2024-11-13 06:19:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839682455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052785462] [2024-11-13 06:19:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:15,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) 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-11-13 06:19:15,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:15,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:15,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:15,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 06:19:16,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1432177832, now seen corresponding path program 1 times [2024-11-13 06:19:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140636174] [2024-11-13 06:19:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140636174] [2024-11-13 06:19:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140636174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832349626] [2024-11-13 06:19:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:17,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:17,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 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-11-13 06:19:17,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:17,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:17,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 06:19:17,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1061516115, now seen corresponding path program 1 times [2024-11-13 06:19:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492367043] [2024-11-13 06:19:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492367043] [2024-11-13 06:19:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492367043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774957670] [2024-11-13 06:19:18,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:18,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:18,216 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:18,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 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-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:18,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:19:18,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:18,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1776705093, now seen corresponding path program 1 times [2024-11-13 06:19:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465856232] [2024-11-13 06:19:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465856232] [2024-11-13 06:19:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465856232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972295762] [2024-11-13 06:19:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:19,725 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-11-13 06:19:19,726 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-11-13 06:19:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:19,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 06:19:19,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:20,140 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 13 treesize of output 9 [2024-11-13 06:19:20,170 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 23 treesize of output 22 [2024-11-13 06:19:20,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:20,209 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 32 treesize of output 34 [2024-11-13 06:19:20,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:20,253 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 41 treesize of output 46 [2024-11-13 06:19:20,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:19:20,398 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 45 treesize of output 34 [2024-11-13 06:19:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:20,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:20,434 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 7 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 6 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:19:20,548 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse1 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_1322 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse1))) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 6 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:19:20,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse1 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_1322 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse1))) (forall ((v_ArrVal_1322 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse2))) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:19:20,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork0_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse3 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|) .cse1 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse1) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1322 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse2))) (forall ((v_ArrVal_1322 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) .cse3))) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1322) |c_t1_funThread1of1ForFork0_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork0_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:19:20,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:20,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:19:20,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:20,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:19:20,655 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:20,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:20,661 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:20,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:20,669 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:20,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:19:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972295762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:20,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:20,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:19:20,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886136238] [2024-11-13 06:19:20,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:20,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:19:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:19:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-11-13 06:19:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:20,828 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.464285714285714) internal successors, (321), 29 states have internal predecessors, (321), 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-11-13 06:19:20,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:20,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:20,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:20,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:20,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:20,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:20,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:22,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 06:19:22,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:22,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1003026261, now seen corresponding path program 1 times [2024-11-13 06:19:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617830432] [2024-11-13 06:19:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617830432] [2024-11-13 06:19:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617830432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964765980] [2024-11-13 06:19:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:22,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:22,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:22,954 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-11-13 06:19:22,956 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-11-13 06:19:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:23,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:19:23,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:23,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964765980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:23,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:19:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410182121] [2024-11-13 06:19:23,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:23,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:19:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:23,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:19:23,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:19:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:23,403 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:23,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.2) internal successors, (332), 10 states have internal predecessors, (332), 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-11-13 06:19:23,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:23,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:23,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:23,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:23,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:23,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:23,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:23,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:24,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 06:19:24,904 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,SelfDestructingSolverStorable9 [2024-11-13 06:19:24,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash -780049736, now seen corresponding path program 1 times [2024-11-13 06:19:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:24,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819334577] [2024-11-13 06:19:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819334577] [2024-11-13 06:19:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819334577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480847887] [2024-11-13 06:19:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:25,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:25,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:19:25,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 06:19:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:26,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 06:19:26,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:26,346 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 13 treesize of output 9 [2024-11-13 06:19:26,370 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 23 treesize of output 22 [2024-11-13 06:19:26,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:26,404 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 32 treesize of output 34 [2024-11-13 06:19:26,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:26,450 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 41 treesize of output 46 [2024-11-13 06:19:26,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:19:26,580 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 45 treesize of output 34 [2024-11-13 06:19:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:26,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:26,605 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4))))) is different from false [2024-11-13 06:19:26,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1|)) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1)))))) is different from false [2024-11-13 06:19:26,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)) (.cse1 (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse2 |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_1888 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1|)) (forall ((v_ArrVal_1888 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1888) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse2)))))) is different from false [2024-11-13 06:19:28,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:28,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:19:28,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:28,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:19:28,699 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:28,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:28,703 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:28,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:28,707 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:28,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:19:28,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480847887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:28,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:28,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:19:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695552653] [2024-11-13 06:19:28,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:19:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:28,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:19:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=537, Unknown=17, NotChecked=150, Total=812 [2024-11-13 06:19:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:28,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:28,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 13.071428571428571) internal successors, (366), 29 states have internal predecessors, (366), 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-11-13 06:19:28,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:28,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:28,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:28,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:30,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 06:19:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:30,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1463715865, now seen corresponding path program 1 times [2024-11-13 06:19:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045403491] [2024-11-13 06:19:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045403491] [2024-11-13 06:19:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045403491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068416277] [2024-11-13 06:19:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:31,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:19:31,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 06:19:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:32,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:19:32,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:32,174 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 13 treesize of output 9 [2024-11-13 06:19:32,203 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 23 treesize of output 22 [2024-11-13 06:19:32,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:32,232 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 32 treesize of output 34 [2024-11-13 06:19:32,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:32,273 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 41 treesize of output 46 [2024-11-13 06:19:32,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:19:32,369 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 45 treesize of output 34 [2024-11-13 06:19:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:32,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:32,397 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)) 0))) is different from false [2024-11-13 06:19:32,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4)) 0))))) is different from false [2024-11-13 06:19:32,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 6)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork0_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2131 (Array Int Int))) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_2131 (Array Int Int))) (= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 4)))) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork0_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2131) |c_t1_funThread1of1ForFork0_insert_~list#1.base|) .cse2) 0))))) is different from false [2024-11-13 06:19:34,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:34,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:19:34,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:34,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2024-11-13 06:19:34,489 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:34,498 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:34,503 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:19:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068416277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:34,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:19:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903479477] [2024-11-13 06:19:34,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:34,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:19:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:19:34,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=533, Unknown=21, NotChecked=150, Total=812 [2024-11-13 06:19:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:34,646 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:34,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 12.428571428571429) internal successors, (348), 29 states have internal predecessors, (348), 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-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:34,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:36,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 06:19:36,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 06:19:36,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:36,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -209167924, now seen corresponding path program 1 times [2024-11-13 06:19:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:36,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387711440] [2024-11-13 06:19:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:36,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387711440] [2024-11-13 06:19:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387711440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879203547] [2024-11-13 06:19:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:36,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:36,854 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-11-13 06:19:36,856 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-11-13 06:19:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:37,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:19:37,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:37,167 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 13 treesize of output 9 [2024-11-13 06:19:37,186 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 23 treesize of output 22 [2024-11-13 06:19:37,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:37,210 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 32 treesize of output 34 [2024-11-13 06:19:37,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:37,244 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 41 treesize of output 46 [2024-11-13 06:19:37,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:19:37,342 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 45 treesize of output 34 [2024-11-13 06:19:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:37,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:37,364 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 7 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 4)))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 6 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))))) is different from false [2024-11-13 06:19:37,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_2354 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 4)) |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|)) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 6 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))))))) is different from false [2024-11-13 06:19:37,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse2 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|) .cse1 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse2))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 4))))))) is different from false [2024-11-13 06:19:37,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|) .cse3 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|) .cse2 |c_t1_funThread1of1ForFork0_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse2))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse3))) (forall ((v_ArrVal_2354 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2354) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 4))))))) is different from false [2024-11-13 06:19:37,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:37,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:19:37,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:37,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:19:37,551 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:37,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:37,555 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:37,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:37,565 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:19:37,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:19:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:19:37,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879203547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:37,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:37,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:19:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786527703] [2024-11-13 06:19:37,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:19:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:19:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-11-13 06:19:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:37,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.214285714285714) internal successors, (230), 29 states have internal predecessors, (230), 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-11-13 06:19:37,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:37,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:37,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:39,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-13 06:19:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:39,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-11-13 06:19:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 621186623, now seen corresponding path program 1 times [2024-11-13 06:19:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718794073] [2024-11-13 06:19:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718794073] [2024-11-13 06:19:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718794073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:19:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905430161] [2024-11-13 06:19:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:19:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:19:40,089 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-11-13 06:19:40,090 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-11-13 06:19:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:40,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:19:40,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:19:40,371 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-11-13 06:19:40,391 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-11-13 06:19:40,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:40,417 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-11-13 06:19:40,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:19:40,446 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-11-13 06:19:40,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:19:40,537 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-11-13 06:19:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:40,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:19:40,556 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 3 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) is different from false [2024-11-13 06:19:40,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)))) (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) |c_t1_funThread1of1ForFork0_init_~p#1.offset|) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|))))) is different from false [2024-11-13 06:19:40,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_t1_funThread1of1ForFork0_init_~p#1.offset|)) (.cse2 (+ 3 |c_t1_funThread1of1ForFork0_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|) .cse2 |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2549 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) |c_t1_funThread1of1ForFork0_init_~p#1.offset|) |c_t1_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2549 (Array Int Int))) (= |c_t1_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2549) |c_t1_funThread1of1ForFork0_init_~p#1.base|) .cse2)))))) is different from false [2024-11-13 06:19:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:19:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905430161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:19:42,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:19:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-13 06:19:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71327359] [2024-11-13 06:19:42,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:19:42,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 06:19:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 06:19:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2024-11-13 06:19:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:42,639 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.888888888888889) internal successors, (213), 28 states have internal predecessors, (213), 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-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:42,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:42,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:42,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:42,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:42,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-13 06:19:43,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-13 06:19:43,900 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-11-13 06:19:44,087 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,SelfDestructingSolverStorable13 [2024-11-13 06:19:44,104 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 06:19:44,104 INFO L317 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/3) [2024-11-13 06:19:44,108 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:44,111 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:19:44,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:19:44,112 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:44,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-13 06:19:44,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -465024094, now seen corresponding path program 1 times [2024-11-13 06:19:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:44,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508105475] [2024-11-13 06:19:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:44,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:44,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508105475] [2024-11-13 06:19:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508105475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:19:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504212601] [2024-11-13 06:19:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:44,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:19:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:19:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:19:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:44,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 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-11-13 06:19:44,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 06:19:44,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1422277775, now seen corresponding path program 1 times [2024-11-13 06:19:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017615396] [2024-11-13 06:19:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:44,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017615396] [2024-11-13 06:19:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017615396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:19:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19992307] [2024-11-13 06:19:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:19:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:19:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:19:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,215 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:44,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 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-11-13 06:19:44,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 06:19:44,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:44,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash -756732128, now seen corresponding path program 1 times [2024-11-13 06:19:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041154028] [2024-11-13 06:19:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041154028] [2024-11-13 06:19:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041154028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:44,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264416525] [2024-11-13 06:19:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:44,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 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-11-13 06:19:44,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 06:19:44,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 739173495, now seen corresponding path program 1 times [2024-11-13 06:19:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899347320] [2024-11-13 06:19:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899347320] [2024-11-13 06:19:44,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899347320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:44,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:44,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:44,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72207123] [2024-11-13 06:19:44,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:44,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:44,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 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-11-13 06:19:44,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:44,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 06:19:44,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 254416356, now seen corresponding path program 1 times [2024-11-13 06:19:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277715834] [2024-11-13 06:19:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:19:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:19:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:19:45,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277715834] [2024-11-13 06:19:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277715834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:19:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:19:45,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:19:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104875099] [2024-11-13 06:19:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:19:45,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:19:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:19:45,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:19:45,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:19:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:45,193 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:19:45,193 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-11-13 06:19:45,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:45,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:45,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:45,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:45,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:19:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:19:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:19:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 06:19:45,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:19:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:19:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 30405680, now seen corresponding path program 1 times [2024-11-13 06:19:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:19:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670971] [2024-11-13 06:19:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:19:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:19:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:19:45,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:19:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:19:45,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:19:45,508 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:19:45,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-13 06:19:45,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-13 06:19:45,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2024-11-13 06:19:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 06:19:45,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 06:19:45,514 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (3/3) [2024-11-13 06:19:45,515 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:19:45,515 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 06:19:45,580 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-11-13 06:19:45,586 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:45,587 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:19:45,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of2ForFork1 ======== [2024-11-13 06:19:45,588 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:19:45,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 06:20:01,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:20:01,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash -903932974, now seen corresponding path program 1 times [2024-11-13 06:20:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:01,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567824986] [2024-11-13 06:20:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 06:20:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567824986] [2024-11-13 06:20:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567824986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:20:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370293625] [2024-11-13 06:20:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:01,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:20:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:20:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:20:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:01,843 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.5) internal successors, (145), 3 states have internal predecessors, (145), 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-11-13 06:20:01,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 06:20:03,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:20:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1102544823, now seen corresponding path program 1 times [2024-11-13 06:20:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045693917] [2024-11-13 06:20:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045693917] [2024-11-13 06:20:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045693917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:20:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467260725] [2024-11-13 06:20:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:20:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:20:03,725 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-11-13 06:20:03,727 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-11-13 06:20:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:04,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 06:20:04,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:20:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:04,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:20:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467260725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:20:04,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:20:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-13 06:20:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056716369] [2024-11-13 06:20:04,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:20:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 06:20:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 06:20:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-13 06:20:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:04,208 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:20:04,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:04,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:20:09,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-11-13 06:20:09,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-13 06:20:09,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-13 06:20:09,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-13 06:20:09,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-13 06:20:09,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-13 06:20:09,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-13 06:20:09,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-13 06:20:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 06:20:09,572 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,SelfDestructingSolverStorable21 [2024-11-13 06:20:09,575 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 06:20:09,576 INFO L317 ceAbstractionStarter]: Result for error location t2_funThread1of2ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/5) [2024-11-13 06:20:09,582 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:09,584 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:20:09,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:20:09,584 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:09,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-13 06:20:09,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -235733996, now seen corresponding path program 1 times [2024-11-13 06:20:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193979615] [2024-11-13 06:20:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:09,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193979615] [2024-11-13 06:20:09,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193979615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:09,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:20:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50112870] [2024-11-13 06:20:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:09,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:20:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:20:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:20:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,625 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:09,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 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-11-13 06:20:09,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 06:20:09,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:09,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1919543453, now seen corresponding path program 1 times [2024-11-13 06:20:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936737139] [2024-11-13 06:20:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936737139] [2024-11-13 06:20:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936737139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:20:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678729041] [2024-11-13 06:20:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:20:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:20:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:20:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,671 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:09,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 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-11-13 06:20:09,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 06:20:09,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:09,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash -505318446, now seen corresponding path program 1 times [2024-11-13 06:20:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799250873] [2024-11-13 06:20:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799250873] [2024-11-13 06:20:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799250873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:20:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766338797] [2024-11-13 06:20:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:09,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:20:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:20:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:20:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,888 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:09,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 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-11-13 06:20:09,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:09,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 06:20:09,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:09,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:09,916 INFO L85 PathProgramCache]: Analyzing trace with hash -466063319, now seen corresponding path program 1 times [2024-11-13 06:20:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:09,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868893794] [2024-11-13 06:20:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868893794] [2024-11-13 06:20:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868893794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:10,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:20:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220136816] [2024-11-13 06:20:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:10,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:20:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:10,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:20:10,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:20:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:10,152 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 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-11-13 06:20:10,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 06:20:10,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:10,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1455270692, now seen corresponding path program 1 times [2024-11-13 06:20:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529519880] [2024-11-13 06:20:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:20:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:20:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:20:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529519880] [2024-11-13 06:20:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529519880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:20:10,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:20:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:20:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008915781] [2024-11-13 06:20:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:20:10,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:20:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:20:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:20:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:20:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:10,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:20:10,494 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-11-13 06:20:10,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:20:10,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 06:20:10,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-13 06:20:10,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:20:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1604855675, now seen corresponding path program 1 times [2024-11-13 06:20:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:20:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564146714] [2024-11-13 06:20:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:20:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:20:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:20:10,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:20:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:20:10,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:20:10,857 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:20:10,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-13 06:20:10,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-13 06:20:10,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-13 06:20:10,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-13 06:20:10,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2024-11-13 06:20:10,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 06:20:10,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-13 06:20:10,863 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/5) [2024-11-13 06:20:10,863 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:20:10,863 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-13 06:20:11,054 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-11-13 06:20:11,060 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:11,062 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:20:11,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread3of3ForFork1 ======== [2024-11-13 06:20:11,063 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;@55bbf260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:11,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations.