./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:54:33,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:54:33,322 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DataRace-32bit-Taipan_Default.epf [2024-11-14 04:54:33,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:54:33,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:54:33,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:54:33,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:54:33,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:54:33,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:54:33,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:54:33,360 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:54:33,360 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:54:33,360 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:54:33,361 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:54:33,361 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:54:33,361 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:54:33,361 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:54:33,361 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:54:33,362 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:54:33,362 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:54:33,362 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:54:33,362 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:54:33,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:54:33,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:54:33,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:54:33,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:54:33,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:54:33,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:54:33,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:54:33,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:54:33,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:54:33,364 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-14 04:54:33,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:54:33,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:54:33,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:54:33,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:54:33,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:54:33,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:54:33,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:54:33,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:54:33,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:54:33,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:54:33,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:54:33,366 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:54:33,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:54:33,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:54:33,367 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:54:33,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:54:33,367 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-11-14 04:54:33,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:54:33,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:54:33,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:54:33,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:54:33,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:54:33,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i Unable to find full path for "g++" [2024-11-14 04:54:36,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:54:36,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:54:36,511 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-11-14 04:54:36,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/data/845dcc618/79befd361721454ca4b29cc0278bbf8b/FLAGbb77176bb [2024-11-14 04:54:36,552 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/data/845dcc618/79befd361721454ca4b29cc0278bbf8b [2024-11-14 04:54:36,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:54:36,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:54:36,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:54:36,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:54:36,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:54:36,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:54:36" (1/1) ... [2024-11-14 04:54:36,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e322e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:36, skipping insertion in model container [2024-11-14 04:54:36,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:54:36" (1/1) ... [2024-11-14 04:54:36,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:54:37,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:54:37,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:54:37,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:54:37,372 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:54:37,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37 WrapperNode [2024-11-14 04:54:37,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:54:37,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:54:37,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:54:37,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:54:37,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,426 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2024-11-14 04:54:37,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:54:37,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:54:37,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:54:37,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:54:37,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:54:37,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:54:37,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:54:37,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:54:37,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (1/1) ... [2024-11-14 04:54:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:54:37,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:54:37,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:54:37,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:54:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:54:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:54:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 04:54:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:54:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-14 04:54:37,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 04:54:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:54:37,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:54:37,572 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 04:54:37,779 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:54:37,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:54:38,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:54:38,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:54:38,302 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:54:38,302 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 04:54:38,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:54:38 BoogieIcfgContainer [2024-11-14 04:54:38,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:54:38,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:54:38,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:54:38,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:54:38,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:54:36" (1/3) ... [2024-11-14 04:54:38,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf59b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:54:38, skipping insertion in model container [2024-11-14 04:54:38,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:54:37" (2/3) ... [2024-11-14 04:54:38,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf59b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:54:38, skipping insertion in model container [2024-11-14 04:54:38,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:54:38" (3/3) ... [2024-11-14 04:54:38,324 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-11-14 04:54:38,345 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:54:38,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 135 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2024-11-14 04:54:38,349 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:54:38,456 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-14 04:54:38,516 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 150 transitions, 307 flow [2024-11-14 04:54:38,764 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2602 states, 2569 states have (on average 2.2281043207473723) internal successors, (5724), 2601 states have internal predecessors, (5724), 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-14 04:54:38,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:54:38,823 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=FINITE_AUTOMATA, 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;@7bd3e404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:54:38,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-14 04:54:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 2602 states, 2569 states have (on average 2.2281043207473723) internal successors, (5724), 2601 states have internal predecessors, (5724), 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-14 04:54:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:54:38,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:38,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:38,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:38,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1541975420, now seen corresponding path program 1 times [2024-11-14 04:54:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967125708] [2024-11-14 04:54:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:39,139 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-14 04:54:39,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:39,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967125708] [2024-11-14 04:54:39,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967125708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:39,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:54:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500184365] [2024-11-14 04:54:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:54:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:54:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:54:39,196 INFO L87 Difference]: Start difference. First operand has 2602 states, 2569 states have (on average 2.2281043207473723) internal successors, (5724), 2601 states have internal predecessors, (5724), 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) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:54:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:39,467 INFO L93 Difference]: Finished difference Result 5027 states and 11124 transitions. [2024-11-14 04:54:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:54:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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) Word has length 38 [2024-11-14 04:54:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:39,586 INFO L225 Difference]: With dead ends: 5027 [2024-11-14 04:54:39,586 INFO L226 Difference]: Without dead ends: 2391 [2024-11-14 04:54:39,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:54:39,609 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:39,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:54:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2024-11-14 04:54:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2024-11-14 04:54:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2356 states have (on average 1.9736842105263157) internal successors, (4650), 2390 states have internal predecessors, (4650), 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-14 04:54:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 4650 transitions. [2024-11-14 04:54:39,878 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 4650 transitions. Word has length 38 [2024-11-14 04:54:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 4650 transitions. [2024-11-14 04:54:39,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:54:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 4650 transitions. [2024-11-14 04:54:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:54:39,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:39,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:39,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:54:39,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 24205615, now seen corresponding path program 1 times [2024-11-14 04:54:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304051845] [2024-11-14 04:54:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:40,185 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-14 04:54:40,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304051845] [2024-11-14 04:54:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304051845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:40,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:40,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:54:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922600514] [2024-11-14 04:54:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:40,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:54:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:54:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:40,191 INFO L87 Difference]: Start difference. First operand 2391 states and 4650 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:54:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:40,361 INFO L93 Difference]: Finished difference Result 2399 states and 4657 transitions. [2024-11-14 04:54:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:54:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2024-11-14 04:54:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:40,409 INFO L225 Difference]: With dead ends: 2399 [2024-11-14 04:54:40,409 INFO L226 Difference]: Without dead ends: 2369 [2024-11-14 04:54:40,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:40,413 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 54 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:40,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 222 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:54:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2024-11-14 04:54:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2024-11-14 04:54:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2335 states have (on average 1.9811563169164883) internal successors, (4626), 2368 states have internal predecessors, (4626), 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-14 04:54:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 4626 transitions. [2024-11-14 04:54:40,509 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 4626 transitions. Word has length 40 [2024-11-14 04:54:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 4626 transitions. [2024-11-14 04:54:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:54:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 4626 transitions. [2024-11-14 04:54:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 04:54:40,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:40,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:54:40,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:40,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1530594364, now seen corresponding path program 1 times [2024-11-14 04:54:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96532644] [2024-11-14 04:54:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:41,314 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-14 04:54:41,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:41,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96532644] [2024-11-14 04:54:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96532644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:41,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:41,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:54:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137881458] [2024-11-14 04:54:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:41,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:54:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:54:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:54:41,319 INFO L87 Difference]: Start difference. First operand 2369 states and 4626 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 04:54:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:41,683 INFO L93 Difference]: Finished difference Result 2369 states and 4626 transitions. [2024-11-14 04:54:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:54:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) Word has length 41 [2024-11-14 04:54:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:41,706 INFO L225 Difference]: With dead ends: 2369 [2024-11-14 04:54:41,706 INFO L226 Difference]: Without dead ends: 2326 [2024-11-14 04:54:41,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:54:41,709 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 213 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:41,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 449 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:54:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2024-11-14 04:54:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2326. [2024-11-14 04:54:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2298 states have (on average 1.9765013054830287) internal successors, (4542), 2325 states have internal predecessors, (4542), 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-14 04:54:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 4542 transitions. [2024-11-14 04:54:41,851 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 4542 transitions. Word has length 41 [2024-11-14 04:54:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 2326 states and 4542 transitions. [2024-11-14 04:54:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 04:54:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 4542 transitions. [2024-11-14 04:54:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 04:54:41,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:41,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:41,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:54:41,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:41,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1979621259, now seen corresponding path program 1 times [2024-11-14 04:54:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214535001] [2024-11-14 04:54:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:41,958 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-14 04:54:41,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214535001] [2024-11-14 04:54:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214535001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:41,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:54:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522847160] [2024-11-14 04:54:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:54:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:54:41,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:41,961 INFO L87 Difference]: Start difference. First operand 2326 states and 4542 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-14 04:54:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:42,154 INFO L93 Difference]: Finished difference Result 3003 states and 5824 transitions. [2024-11-14 04:54:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:54:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2024-11-14 04:54:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:42,207 INFO L225 Difference]: With dead ends: 3003 [2024-11-14 04:54:42,208 INFO L226 Difference]: Without dead ends: 2849 [2024-11-14 04:54:42,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:42,211 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:42,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 262 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:54:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2024-11-14 04:54:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2223. [2024-11-14 04:54:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2207 states have (on average 1.961939284096058) internal successors, (4330), 2222 states have internal predecessors, (4330), 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-14 04:54:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 4330 transitions. [2024-11-14 04:54:42,334 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 4330 transitions. Word has length 50 [2024-11-14 04:54:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:42,335 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 4330 transitions. [2024-11-14 04:54:42,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-14 04:54:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 4330 transitions. [2024-11-14 04:54:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 04:54:42,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:42,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:54:42,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash -232351523, now seen corresponding path program 1 times [2024-11-14 04:54:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047013802] [2024-11-14 04:54:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:42,422 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-14 04:54:42,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:42,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047013802] [2024-11-14 04:54:42,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047013802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:42,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:42,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:54:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132118271] [2024-11-14 04:54:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:42,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:54:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:54:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:42,426 INFO L87 Difference]: Start difference. First operand 2223 states and 4330 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-14 04:54:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:42,577 INFO L93 Difference]: Finished difference Result 2354 states and 4587 transitions. [2024-11-14 04:54:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:54:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2024-11-14 04:54:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:42,598 INFO L225 Difference]: With dead ends: 2354 [2024-11-14 04:54:42,599 INFO L226 Difference]: Without dead ends: 2296 [2024-11-14 04:54:42,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:54:42,602 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 58 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:42,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 274 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:54:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-14 04:54:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2230. [2024-11-14 04:54:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2216 states have (on average 1.9593862815884477) internal successors, (4342), 2229 states have internal predecessors, (4342), 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-14 04:54:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 4342 transitions. [2024-11-14 04:54:42,709 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 4342 transitions. Word has length 55 [2024-11-14 04:54:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:54:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 4342 transitions. [2024-11-14 04:54:42,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-14 04:54:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 4342 transitions. [2024-11-14 04:54:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 04:54:42,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:42,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:42,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:54:42,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-14 04:54:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -652344594, now seen corresponding path program 1 times [2024-11-14 04:54:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857969347] [2024-11-14 04:54:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:54:42,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:54:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:54:42,846 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:54:42,846 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:54:42,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-14 04:54:42,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-14 04:54:42,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-14 04:54:42,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-14 04:54:42,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-14 04:54:42,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-14 04:54:42,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-14 04:54:42,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-14 04:54:42,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-14 04:54:42,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-14 04:54:42,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-14 04:54:42,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-14 04:54:42,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 04:54:42,865 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-14 04:54:42,868 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-14 04:54:42,868 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-14 04:54:42,938 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 04:54:42,942 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 182 places, 199 transitions, 414 flow [2024-11-14 04:54:48,103 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 109366 states, 109183 states have (on average 3.3235668556460256) internal successors, (362877), 109365 states have internal predecessors, (362877), 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-14 04:54:48,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:54:48,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=FINITE_AUTOMATA, 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;@7bd3e404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:54:48,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-14 04:54:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 109366 states, 109183 states have (on average 3.3235668556460256) internal successors, (362877), 109365 states have internal predecessors, (362877), 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-14 04:54:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 04:54:48,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:54:48,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:54:48,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:54:48,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:54:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1792654556, now seen corresponding path program 1 times [2024-11-14 04:54:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:54:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818115233] [2024-11-14 04:54:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:54:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:54:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:54:48,751 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-14 04:54:48,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:54:48,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818115233] [2024-11-14 04:54:48,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818115233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:54:48,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:54:48,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:54:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396539947] [2024-11-14 04:54:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:54:48,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:54:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:54:48,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:54:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:54:49,117 INFO L87 Difference]: Start difference. First operand has 109366 states, 109183 states have (on average 3.3235668556460256) internal successors, (362877), 109365 states have internal predecessors, (362877), 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) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:54:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:54:53,623 INFO L93 Difference]: Finished difference Result 214886 states and 713568 transitions. [2024-11-14 04:54:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:54:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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) Word has length 38 [2024-11-14 04:54:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:54:55,002 INFO L225 Difference]: With dead ends: 214886 [2024-11-14 04:54:55,003 INFO L226 Difference]: Without dead ends: 104208 [2024-11-14 04:54:55,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:54:55,324 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:54:55,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:54:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104208 states. [2024-11-14 04:54:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104208 to 104208. [2024-11-14 04:54:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104208 states, 104001 states have (on average 2.927433390063557) internal successors, (304456), 104207 states have internal predecessors, (304456), 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-14 04:55:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104208 states to 104208 states and 304456 transitions. [2024-11-14 04:55:00,637 INFO L78 Accepts]: Start accepts. Automaton has 104208 states and 304456 transitions. Word has length 38 [2024-11-14 04:55:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:00,638 INFO L471 AbstractCegarLoop]: Abstraction has 104208 states and 304456 transitions. [2024-11-14 04:55:00,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-14 04:55:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 104208 states and 304456 transitions. [2024-11-14 04:55:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 04:55:00,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:00,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:00,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 04:55:00,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:55:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash -360269137, now seen corresponding path program 1 times [2024-11-14 04:55:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:55:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034688158] [2024-11-14 04:55:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:55:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:00,750 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-14 04:55:00,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:55:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034688158] [2024-11-14 04:55:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034688158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:55:00,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:55:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:55:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405459795] [2024-11-14 04:55:00,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:55:00,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:55:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:55:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:00,753 INFO L87 Difference]: Start difference. First operand 104208 states and 304456 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:55:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:02,427 INFO L93 Difference]: Finished difference Result 104216 states and 304463 transitions. [2024-11-14 04:55:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:55:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2024-11-14 04:55:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:55:03,274 INFO L225 Difference]: With dead ends: 104216 [2024-11-14 04:55:03,274 INFO L226 Difference]: Without dead ends: 104186 [2024-11-14 04:55:03,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:03,324 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 54 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:55:03,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 292 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:55:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104186 states. [2024-11-14 04:55:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104186 to 104186. [2024-11-14 04:55:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104186 states, 103980 states have (on average 2.92779380650125) internal successors, (304432), 104185 states have internal predecessors, (304432), 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-14 04:55:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104186 states to 104186 states and 304432 transitions. [2024-11-14 04:55:07,209 INFO L78 Accepts]: Start accepts. Automaton has 104186 states and 304432 transitions. Word has length 40 [2024-11-14 04:55:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 104186 states and 304432 transitions. [2024-11-14 04:55:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 04:55:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 104186 states and 304432 transitions. [2024-11-14 04:55:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 04:55:07,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:07,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:55:07,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:55:07,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1798188157, now seen corresponding path program 1 times [2024-11-14 04:55:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:55:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924765997] [2024-11-14 04:55:07,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:55:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:07,713 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-14 04:55:07,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:55:07,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924765997] [2024-11-14 04:55:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924765997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:55:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:55:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:55:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078419073] [2024-11-14 04:55:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:55:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:55:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:55:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:55:07,719 INFO L87 Difference]: Start difference. First operand 104186 states and 304432 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 04:55:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:10,465 INFO L93 Difference]: Finished difference Result 104186 states and 304432 transitions. [2024-11-14 04:55:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:55:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) Word has length 41 [2024-11-14 04:55:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:55:11,563 INFO L225 Difference]: With dead ends: 104186 [2024-11-14 04:55:11,563 INFO L226 Difference]: Without dead ends: 102379 [2024-11-14 04:55:11,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:55:11,588 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 420 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:55:11,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 825 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:55:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102379 states. [2024-11-14 04:55:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102379 to 102379. [2024-11-14 04:55:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102379 states, 102204 states have (on average 2.926891315408399) internal successors, (299140), 102378 states have internal predecessors, (299140), 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-14 04:55:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102379 states to 102379 states and 299140 transitions. [2024-11-14 04:55:14,963 INFO L78 Accepts]: Start accepts. Automaton has 102379 states and 299140 transitions. Word has length 41 [2024-11-14 04:55:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:14,963 INFO L471 AbstractCegarLoop]: Abstraction has 102379 states and 299140 transitions. [2024-11-14 04:55:14,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-14 04:55:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 102379 states and 299140 transitions. [2024-11-14 04:55:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 04:55:14,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:14,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:55:14,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:55:14,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2141834906, now seen corresponding path program 1 times [2024-11-14 04:55:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:55:14,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199564577] [2024-11-14 04:55:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:55:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:15,021 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-14 04:55:15,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:55:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199564577] [2024-11-14 04:55:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199564577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:55:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:55:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:55:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96878526] [2024-11-14 04:55:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:55:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:55:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:55:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:15,023 INFO L87 Difference]: Start difference. First operand 102379 states and 299140 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-14 04:55:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:18,171 INFO L93 Difference]: Finished difference Result 168185 states and 485621 transitions. [2024-11-14 04:55:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:55:18,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2024-11-14 04:55:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:55:18,837 INFO L225 Difference]: With dead ends: 168185 [2024-11-14 04:55:18,837 INFO L226 Difference]: Without dead ends: 157039 [2024-11-14 04:55:18,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:18,904 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 131 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:55:18,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 345 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:55:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157039 states. [2024-11-14 04:55:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157039 to 105839. [2024-11-14 04:55:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105839 states, 105692 states have (on average 2.911289406956061) internal successors, (307700), 105838 states have internal predecessors, (307700), 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-14 04:55:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105839 states to 105839 states and 307700 transitions. [2024-11-14 04:55:23,811 INFO L78 Accepts]: Start accepts. Automaton has 105839 states and 307700 transitions. Word has length 50 [2024-11-14 04:55:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:23,811 INFO L471 AbstractCegarLoop]: Abstraction has 105839 states and 307700 transitions. [2024-11-14 04:55:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-14 04:55:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 105839 states and 307700 transitions. [2024-11-14 04:55:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 04:55:23,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:23,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:23,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:55:23,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:55:23,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1811203531, now seen corresponding path program 1 times [2024-11-14 04:55:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:55:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153557425] [2024-11-14 04:55:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:55:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:23,880 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-14 04:55:23,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:55:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153557425] [2024-11-14 04:55:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153557425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:55:23,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:55:23,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:55:23,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348901228] [2024-11-14 04:55:23,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:55:23,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:55:23,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:55:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:23,882 INFO L87 Difference]: Start difference. First operand 105839 states and 307700 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-14 04:55:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:26,166 INFO L93 Difference]: Finished difference Result 114704 states and 333500 transitions. [2024-11-14 04:55:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:55:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2024-11-14 04:55:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:55:26,864 INFO L225 Difference]: With dead ends: 114704 [2024-11-14 04:55:26,865 INFO L226 Difference]: Without dead ends: 112096 [2024-11-14 04:55:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:55:26,903 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 100 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:55:26,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 362 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:55:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112096 states. [2024-11-14 04:55:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112096 to 107622. [2024-11-14 04:55:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107622 states, 107480 states have (on average 2.9104484555266095) internal successors, (312815), 107621 states have internal predecessors, (312815), 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-14 04:55:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107622 states to 107622 states and 312815 transitions. [2024-11-14 04:55:30,721 INFO L78 Accepts]: Start accepts. Automaton has 107622 states and 312815 transitions. Word has length 55 [2024-11-14 04:55:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:55:30,721 INFO L471 AbstractCegarLoop]: Abstraction has 107622 states and 312815 transitions. [2024-11-14 04:55:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-14 04:55:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 107622 states and 312815 transitions. [2024-11-14 04:55:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 04:55:30,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:55:30,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:55:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:55:30,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-14 04:55:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:55:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1725748719, now seen corresponding path program 1 times [2024-11-14 04:55:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:55:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728178426] [2024-11-14 04:55:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:55:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:30,891 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-14 04:55:30,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:55:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728178426] [2024-11-14 04:55:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728178426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:55:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043746870] [2024-11-14 04:55:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:55:30,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:55:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:55:30,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:55:30,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24b4ddbc-a1ad-4b8c-afbe-1cc9001f1bb8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:55:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:55:31,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:55:31,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:55:31,182 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-14 04:55:31,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:55:31,282 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-14 04:55:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043746870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:55:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [87324924] [2024-11-14 04:55:31,294 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 04:55:31,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:55:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 04:55:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915651283] [2024-11-14 04:55:31,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:55:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:55:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:55:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:55:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:55:31,300 INFO L87 Difference]: Start difference. First operand 107622 states and 312815 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-14 04:55:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:55:34,130 INFO L93 Difference]: Finished difference Result 107622 states and 312815 transitions. [2024-11-14 04:55:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:55:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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) Word has length 66 [2024-11-14 04:55:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted.