./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91 --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 bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:56:33,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:56:33,655 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-24 23:56:33,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:56:33,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:56:33,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:56:33,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:56:33,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:56:33,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:56:33,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:56:33,723 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:56:33,724 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:56:33,725 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:56:33,727 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:56:33,727 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:56:33,728 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:56:33,728 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:56:33,729 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:56:33,730 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:56:33,731 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:56:33,731 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:56:33,732 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:56:33,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:56:33,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:56:33,735 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:56:33,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:56:33,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:56:33,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:56:33,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:56:33,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:56:33,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:56:33,739 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 23:56:33,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:56:33,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:56:33,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:56:33,740 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:56:33,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:56:33,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:56:33,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:56:33,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:56:33,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:56:33,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:56:33,744 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:56:33,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:56:33,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:56:33,745 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:56:33,746 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:56:33,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:56:33,746 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91 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 -> bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 [2023-11-24 23:56:34,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:56:34,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:56:34,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:56:34,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:56:34,102 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:56:34,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-24 23:56:37,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:56:37,680 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:56:37,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-24 23:56:37,709 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/data/96ae78009/0e17fb239c264d55aaa44a3a6d328160/FLAG7d8fff744 [2023-11-24 23:56:37,725 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/data/96ae78009/0e17fb239c264d55aaa44a3a6d328160 [2023-11-24 23:56:37,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:56:37,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:56:37,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:56:37,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:56:37,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:56:37,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:56:37" (1/1) ... [2023-11-24 23:56:37,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fee554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:37, skipping insertion in model container [2023-11-24 23:56:37,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:56:37" (1/1) ... [2023-11-24 23:56:37,826 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:56:38,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:56:38,426 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:56:38,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:56:38,550 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:56:38,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38 WrapperNode [2023-11-24 23:56:38,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:56:38,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:56:38,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:56:38,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:56:38,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,626 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-11-24 23:56:38,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:56:38,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:56:38,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:56:38,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:56:38,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:56:38,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:56:38,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:56:38,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:56:38,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (1/1) ... [2023-11-24 23:56:38,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:56:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:38,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:56:38,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:56:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:56:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:56:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:56:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:56:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:56:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:56:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:56:38,775 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 23:56:38,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 23:56:38,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:56:38,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:56:38,778 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:56:38,921 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:56:38,923 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:56:39,242 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:56:39,254 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:56:39,255 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:56:39,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:56:39 BoogieIcfgContainer [2023-11-24 23:56:39,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:56:39,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:56:39,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:56:39,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:56:39,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:56:37" (1/3) ... [2023-11-24 23:56:39,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226fcb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:56:39, skipping insertion in model container [2023-11-24 23:56:39,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:56:38" (2/3) ... [2023-11-24 23:56:39,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226fcb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:56:39, skipping insertion in model container [2023-11-24 23:56:39,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:56:39" (3/3) ... [2023-11-24 23:56:39,267 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i [2023-11-24 23:56:39,278 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:56:39,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:56:39,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-24 23:56:39,291 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:56:39,355 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 23:56:39,391 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 103 transitions, 213 flow [2023-11-24 23:56:39,496 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1001 states, 983 states have (on average 1.9348931841302137) internal successors, (1902), 1000 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:39,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:56:39,524 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b90ca99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:56:39,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 23:56:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 1001 states, 983 states have (on average 1.9348931841302137) internal successors, (1902), 1000 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 23:56:39,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:39,539 INFO L195 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] [2023-11-24 23:56:39,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 23:56:39,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1764504615, now seen corresponding path program 1 times [2023-11-24 23:56:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053596817] [2023-11-24 23:56:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:40,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053596817] [2023-11-24 23:56:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053596817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:40,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:40,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275362724] [2023-11-24 23:56:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:56:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:56:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:40,676 INFO L87 Difference]: Start difference. First operand has 1001 states, 983 states have (on average 1.9348931841302137) internal successors, (1902), 1000 states have internal predecessors, (1902), 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 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:41,085 INFO L93 Difference]: Finished difference Result 1284 states and 2370 transitions. [2023-11-24 23:56:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2023-11-24 23:56:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:41,118 INFO L225 Difference]: With dead ends: 1284 [2023-11-24 23:56:41,118 INFO L226 Difference]: Without dead ends: 1154 [2023-11-24 23:56:41,121 INFO L412 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 [2023-11-24 23:56:41,125 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 112 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:41,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 237 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:56:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2023-11-24 23:56:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1003. [2023-11-24 23:56:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 990 states have (on average 1.8828282828282827) internal successors, (1864), 1002 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1864 transitions. [2023-11-24 23:56:41,247 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1864 transitions. Word has length 31 [2023-11-24 23:56:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1864 transitions. [2023-11-24 23:56:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1864 transitions. [2023-11-24 23:56:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-24 23:56:41,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:41,250 INFO L195 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] [2023-11-24 23:56:41,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:56:41,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 23:56:41,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -75319162, now seen corresponding path program 1 times [2023-11-24 23:56:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780798859] [2023-11-24 23:56:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:41,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780798859] [2023-11-24 23:56:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780798859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173657287] [2023-11-24 23:56:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:56:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:56:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:56:41,413 INFO L87 Difference]: Start difference. First operand 1003 states and 1864 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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) [2023-11-24 23:56:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:41,491 INFO L93 Difference]: Finished difference Result 1004 states and 1864 transitions. [2023-11-24 23:56:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:41,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 [2023-11-24 23:56:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:41,500 INFO L225 Difference]: With dead ends: 1004 [2023-11-24 23:56:41,500 INFO L226 Difference]: Without dead ends: 1001 [2023-11-24 23:56:41,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:41,502 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:41,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 339 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:56:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2023-11-24 23:56:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2023-11-24 23:56:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 988 states have (on average 1.8836032388663968) internal successors, (1861), 1000 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1861 transitions. [2023-11-24 23:56:41,552 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1861 transitions. Word has length 38 [2023-11-24 23:56:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:41,552 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1861 transitions. [2023-11-24 23:56:41,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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) [2023-11-24 23:56:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1861 transitions. [2023-11-24 23:56:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-24 23:56:41,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:41,556 INFO L195 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] [2023-11-24 23:56:41,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:56:41,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 23:56:41,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -141094382, now seen corresponding path program 1 times [2023-11-24 23:56:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344674994] [2023-11-24 23:56:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:42,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344674994] [2023-11-24 23:56:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344674994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212227919] [2023-11-24 23:56:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:42,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:56:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:56:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:42,109 INFO L87 Difference]: Start difference. First operand 1001 states and 1861 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:42,510 INFO L93 Difference]: Finished difference Result 1185 states and 2199 transitions. [2023-11-24 23:56:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:42,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-11-24 23:56:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:42,522 INFO L225 Difference]: With dead ends: 1185 [2023-11-24 23:56:42,522 INFO L226 Difference]: Without dead ends: 1075 [2023-11-24 23:56:42,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:42,530 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 158 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:42,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 428 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:56:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2023-11-24 23:56:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1013. [2023-11-24 23:56:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1000 states have (on average 1.871) internal successors, (1871), 1012 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1871 transitions. [2023-11-24 23:56:42,570 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1871 transitions. Word has length 44 [2023-11-24 23:56:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:42,571 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1871 transitions. [2023-11-24 23:56:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1871 transitions. [2023-11-24 23:56:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-24 23:56:42,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:42,575 INFO L195 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] [2023-11-24 23:56:42,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:56:42,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 23:56:42,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 941060820, now seen corresponding path program 1 times [2023-11-24 23:56:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162156033] [2023-11-24 23:56:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:56:42,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 23:56:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:56:42,699 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-24 23:56:42,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 23:56:42,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-24 23:56:42,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-24 23:56:42,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-24 23:56:42,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-24 23:56:42,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-24 23:56:42,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-24 23:56:42,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-24 23:56:42,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:56:42,710 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 23:56:42,712 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 23:56:42,712 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 23:56:42,742 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 23:56:42,747 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 121 transitions, 258 flow [2023-11-24 23:56:43,501 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17627 states, 17577 states have (on average 2.8148717073448255) internal successors, (49477), 17626 states have internal predecessors, (49477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:43,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:56:43,503 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b90ca99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:56:43,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-24 23:56:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 17627 states, 17577 states have (on average 2.8148717073448255) internal successors, (49477), 17626 states have internal predecessors, (49477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 23:56:43,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:43,538 INFO L195 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] [2023-11-24 23:56:43,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:56:43,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 435998066, now seen corresponding path program 1 times [2023-11-24 23:56:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027993967] [2023-11-24 23:56:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:43,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027993967] [2023-11-24 23:56:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027993967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446126909] [2023-11-24 23:56:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:43,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:56:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:56:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:43,918 INFO L87 Difference]: Start difference. First operand has 17627 states, 17577 states have (on average 2.8148717073448255) internal successors, (49477), 17626 states have internal predecessors, (49477), 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 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:44,778 INFO L93 Difference]: Finished difference Result 27457 states and 75709 transitions. [2023-11-24 23:56:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:44,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2023-11-24 23:56:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:45,098 INFO L225 Difference]: With dead ends: 27457 [2023-11-24 23:56:45,098 INFO L226 Difference]: Without dead ends: 26577 [2023-11-24 23:56:45,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:45,099 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 188 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:45,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 421 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:56:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26577 states. [2023-11-24 23:56:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26577 to 19918. [2023-11-24 23:56:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19918 states, 19875 states have (on average 2.7815849056603774) internal successors, (55284), 19917 states have internal predecessors, (55284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 55284 transitions. [2023-11-24 23:56:46,254 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 55284 transitions. Word has length 31 [2023-11-24 23:56:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:46,254 INFO L495 AbstractCegarLoop]: Abstraction has 19918 states and 55284 transitions. [2023-11-24 23:56:46,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 55284 transitions. [2023-11-24 23:56:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-24 23:56:46,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:46,256 INFO L195 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] [2023-11-24 23:56:46,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:56:46,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:56:46,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 354992102, now seen corresponding path program 1 times [2023-11-24 23:56:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137762478] [2023-11-24 23:56:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:46,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137762478] [2023-11-24 23:56:46,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137762478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:46,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:46,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993818018] [2023-11-24 23:56:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:46,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:56:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:46,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:56:46,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:56:46,381 INFO L87 Difference]: Start difference. First operand 19918 states and 55284 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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) [2023-11-24 23:56:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:46,712 INFO L93 Difference]: Finished difference Result 19919 states and 55284 transitions. [2023-11-24 23:56:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 [2023-11-24 23:56:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:46,823 INFO L225 Difference]: With dead ends: 19919 [2023-11-24 23:56:46,824 INFO L226 Difference]: Without dead ends: 19916 [2023-11-24 23:56:46,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:46,825 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:46,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 406 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:56:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2023-11-24 23:56:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 19916. [2023-11-24 23:56:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19916 states, 19873 states have (on average 2.7817138831580537) internal successors, (55281), 19915 states have internal predecessors, (55281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19916 states to 19916 states and 55281 transitions. [2023-11-24 23:56:47,712 INFO L78 Accepts]: Start accepts. Automaton has 19916 states and 55281 transitions. Word has length 38 [2023-11-24 23:56:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:47,713 INFO L495 AbstractCegarLoop]: Abstraction has 19916 states and 55281 transitions. [2023-11-24 23:56:47,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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) [2023-11-24 23:56:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 19916 states and 55281 transitions. [2023-11-24 23:56:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-24 23:56:47,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:47,715 INFO L195 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] [2023-11-24 23:56:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:56:47,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:56:47,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash 791198914, now seen corresponding path program 1 times [2023-11-24 23:56:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419809965] [2023-11-24 23:56:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:48,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419809965] [2023-11-24 23:56:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419809965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:56:48,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:56:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:56:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567231120] [2023-11-24 23:56:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:56:48,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:56:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:56:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:48,182 INFO L87 Difference]: Start difference. First operand 19916 states and 55281 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:48,845 INFO L93 Difference]: Finished difference Result 25945 states and 72577 transitions. [2023-11-24 23:56:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:56:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-11-24 23:56:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:48,979 INFO L225 Difference]: With dead ends: 25945 [2023-11-24 23:56:48,979 INFO L226 Difference]: Without dead ends: 25285 [2023-11-24 23:56:48,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:56:48,983 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 234 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:48,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 568 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:56:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25285 states. [2023-11-24 23:56:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25285 to 23143. [2023-11-24 23:56:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23143 states, 23100 states have (on average 2.794891774891775) internal successors, (64562), 23142 states have internal predecessors, (64562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23143 states to 23143 states and 64562 transitions. [2023-11-24 23:56:49,825 INFO L78 Accepts]: Start accepts. Automaton has 23143 states and 64562 transitions. Word has length 44 [2023-11-24 23:56:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:49,826 INFO L495 AbstractCegarLoop]: Abstraction has 23143 states and 64562 transitions. [2023-11-24 23:56:49,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23143 states and 64562 transitions. [2023-11-24 23:56:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-24 23:56:49,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:49,828 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-11-24 23:56:49,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:56:49,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:56:49,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1936787421, now seen corresponding path program 1 times [2023-11-24 23:56:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481318856] [2023-11-24 23:56:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:50,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481318856] [2023-11-24 23:56:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481318856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027017171] [2023-11-24 23:56:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:50,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:50,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:50,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:56:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:50,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-24 23:56:50,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:51,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:56:51,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:56:51,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:56:51,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:56:51,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:56:51,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 23:56:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:51,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:51,766 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false [2023-11-24 23:56:51,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false [2023-11-24 23:56:51,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_252) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-24 23:56:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:56:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027017171] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106577111] [2023-11-24 23:56:52,203 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-24 23:56:52,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2023-11-24 23:56:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245904780] [2023-11-24 23:56:52,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:52,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-24 23:56:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-24 23:56:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=706, Unknown=3, NotChecked=168, Total=992 [2023-11-24 23:56:52,211 INFO L87 Difference]: Start difference. First operand 23143 states and 64562 transitions. Second operand has 32 states, 31 states have (on average 4.258064516129032) internal successors, (132), 32 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:54,593 INFO L93 Difference]: Finished difference Result 28967 states and 79867 transitions. [2023-11-24 23:56:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 23:56:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.258064516129032) internal successors, (132), 32 states have internal predecessors, (132), 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 [2023-11-24 23:56:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:54,703 INFO L225 Difference]: With dead ends: 28967 [2023-11-24 23:56:54,703 INFO L226 Difference]: Without dead ends: 28776 [2023-11-24 23:56:54,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=350, Invalid=1381, Unknown=3, NotChecked=246, Total=1980 [2023-11-24 23:56:54,705 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1493 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1668 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:54,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1809 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1361 Invalid, 0 Unknown, 1668 Unchecked, 1.5s Time] [2023-11-24 23:56:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28776 states. [2023-11-24 23:56:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28776 to 23187. [2023-11-24 23:56:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23187 states, 23146 states have (on average 2.7914974509634494) internal successors, (64612), 23186 states have internal predecessors, (64612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23187 states to 23187 states and 64612 transitions. [2023-11-24 23:56:55,489 INFO L78 Accepts]: Start accepts. Automaton has 23187 states and 64612 transitions. Word has length 55 [2023-11-24 23:56:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:56:55,490 INFO L495 AbstractCegarLoop]: Abstraction has 23187 states and 64612 transitions. [2023-11-24 23:56:55,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.258064516129032) internal successors, (132), 32 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23187 states and 64612 transitions. [2023-11-24 23:56:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-24 23:56:55,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:56:55,492 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:56:55,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:56:55,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:55,699 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:56:55,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:56:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash -374136260, now seen corresponding path program 1 times [2023-11-24 23:56:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:56:55,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293321373] [2023-11-24 23:56:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:56:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:56,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:56:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293321373] [2023-11-24 23:56:56,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293321373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:56:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432489475] [2023-11-24 23:56:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:56:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:56:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:56:56,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:56:56,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:56:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:56:56,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-24 23:56:56,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:56:56,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:56:56,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 23:56:56,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:56:56,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-24 23:56:56,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:56:56,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 23:56:56,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:56:56,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:56:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:56,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:56:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:56:57,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432489475] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:56:57,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [534567154] [2023-11-24 23:56:57,104 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-24 23:56:57,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:56:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2023-11-24 23:56:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448557179] [2023-11-24 23:56:57,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:56:57,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-24 23:56:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:56:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-24 23:56:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=563, Unknown=5, NotChecked=0, Total=650 [2023-11-24 23:56:57,106 INFO L87 Difference]: Start difference. First operand 23187 states and 64612 transitions. Second operand has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:56:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:56:59,249 INFO L93 Difference]: Finished difference Result 25997 states and 72377 transitions. [2023-11-24 23:56:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 23:56:59,250 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 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 [2023-11-24 23:56:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:56:59,352 INFO L225 Difference]: With dead ends: 25997 [2023-11-24 23:56:59,352 INFO L226 Difference]: Without dead ends: 25637 [2023-11-24 23:56:59,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=998, Unknown=5, NotChecked=0, Total=1260 [2023-11-24 23:56:59,354 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1298 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:56:59,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2285 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-24 23:56:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25637 states. [2023-11-24 23:57:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25637 to 21676. [2023-11-24 23:57:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21676 states, 21637 states have (on average 2.776124231640246) internal successors, (60067), 21675 states have internal predecessors, (60067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21676 states to 21676 states and 60067 transitions. [2023-11-24 23:57:00,327 INFO L78 Accepts]: Start accepts. Automaton has 21676 states and 60067 transitions. Word has length 55 [2023-11-24 23:57:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:57:00,328 INFO L495 AbstractCegarLoop]: Abstraction has 21676 states and 60067 transitions. [2023-11-24 23:57:00,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21676 states and 60067 transitions. [2023-11-24 23:57:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-24 23:57:00,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:57:00,330 INFO L195 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] [2023-11-24 23:57:00,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 23:57:00,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:57:00,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:57:00,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:57:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 210800945, now seen corresponding path program 1 times [2023-11-24 23:57:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:57:00,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514484303] [2023-11-24 23:57:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:57:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:57:00,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:57:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514484303] [2023-11-24 23:57:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514484303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:57:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:57:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:57:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487077836] [2023-11-24 23:57:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:57:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:57:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:57:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:57:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:57:00,968 INFO L87 Difference]: Start difference. First operand 21676 states and 60067 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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) [2023-11-24 23:57:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:57:01,392 INFO L93 Difference]: Finished difference Result 23007 states and 63452 transitions. [2023-11-24 23:57:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:57:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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 [2023-11-24 23:57:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:57:01,474 INFO L225 Difference]: With dead ends: 23007 [2023-11-24 23:57:01,475 INFO L226 Difference]: Without dead ends: 22328 [2023-11-24 23:57:01,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:57:01,478 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 105 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:57:01,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:57:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22328 states. [2023-11-24 23:57:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22328 to 22015. [2023-11-24 23:57:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22015 states, 21977 states have (on average 2.7738999863493654) internal successors, (60962), 22014 states have internal predecessors, (60962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 60962 transitions. [2023-11-24 23:57:02,269 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 60962 transitions. Word has length 55 [2023-11-24 23:57:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:57:02,270 INFO L495 AbstractCegarLoop]: Abstraction has 22015 states and 60962 transitions. [2023-11-24 23:57:02,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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) [2023-11-24 23:57:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 60962 transitions. [2023-11-24 23:57:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:57:02,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:57:02,274 INFO L195 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, 1, 1, 1, 1, 1] [2023-11-24 23:57:02,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:57:02,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:57:02,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:57:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -89455300, now seen corresponding path program 1 times [2023-11-24 23:57:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:57:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898028674] [2023-11-24 23:57:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:57:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-24 23:57:02,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:57:02,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898028674] [2023-11-24 23:57:02,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898028674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:57:02,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:57:02,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:57:02,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956098287] [2023-11-24 23:57:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:57:02,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:57:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:57:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:57:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:57:02,903 INFO L87 Difference]: Start difference. First operand 22015 states and 60962 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:57:03,498 INFO L93 Difference]: Finished difference Result 27354 states and 75909 transitions. [2023-11-24 23:57:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:57:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 61 [2023-11-24 23:57:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:57:03,598 INFO L225 Difference]: With dead ends: 27354 [2023-11-24 23:57:03,599 INFO L226 Difference]: Without dead ends: 26683 [2023-11-24 23:57:03,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:57:03,600 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 228 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:57:03,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 613 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:57:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26683 states. [2023-11-24 23:57:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26683 to 24525. [2023-11-24 23:57:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24525 states, 24487 states have (on average 2.77428839792543) internal successors, (67934), 24524 states have internal predecessors, (67934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24525 states to 24525 states and 67934 transitions. [2023-11-24 23:57:04,357 INFO L78 Accepts]: Start accepts. Automaton has 24525 states and 67934 transitions. Word has length 61 [2023-11-24 23:57:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:57:04,357 INFO L495 AbstractCegarLoop]: Abstraction has 24525 states and 67934 transitions. [2023-11-24 23:57:04,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 24525 states and 67934 transitions. [2023-11-24 23:57:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-24 23:57:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:57:04,365 INFO L195 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] [2023-11-24 23:57:04,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:57:04,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:57:04,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:57:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash -580375793, now seen corresponding path program 1 times [2023-11-24 23:57:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:57:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788785280] [2023-11-24 23:57:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:57:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:05,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:57:05,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788785280] [2023-11-24 23:57:05,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788785280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:57:05,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118684420] [2023-11-24 23:57:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:05,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:57:05,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:57:05,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:57:05,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:57:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:05,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-24 23:57:05,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:57:05,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:57:06,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:57:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 23:57:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:57:06,138 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-24 23:57:06,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-24 23:57:06,410 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 23:57:06,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 23:57:06,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-24 23:57:06,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:57:06,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 23:57:06,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:06,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 23:57:06,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:06,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:57:07,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:57:07,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:57:07,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:57:07,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:57:07,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 23:57:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:07,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:57:07,316 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-24 23:57:07,370 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_521) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-24 23:57:08,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2023-11-24 23:57:08,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-24 23:57:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118684420] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:57:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145387942] [2023-11-24 23:57:08,715 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-24 23:57:08,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:57:08,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41 [2023-11-24 23:57:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547082225] [2023-11-24 23:57:08,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:57:08,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-24 23:57:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:57:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-24 23:57:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1360, Unknown=53, NotChecked=154, Total=1722 [2023-11-24 23:57:08,721 INFO L87 Difference]: Start difference. First operand 24525 states and 67934 transitions. Second operand has 42 states, 41 states have (on average 3.268292682926829) internal successors, (134), 42 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:57:15,970 INFO L93 Difference]: Finished difference Result 42615 states and 117999 transitions. [2023-11-24 23:57:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 23:57:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.268292682926829) internal successors, (134), 42 states have internal predecessors, (134), 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 62 [2023-11-24 23:57:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:57:16,093 INFO L225 Difference]: With dead ends: 42615 [2023-11-24 23:57:16,094 INFO L226 Difference]: Without dead ends: 42600 [2023-11-24 23:57:16,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=643, Invalid=3580, Unknown=75, NotChecked=258, Total=4556 [2023-11-24 23:57:16,096 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 1289 mSDsluCounter, 5016 mSDsCounter, 0 mSdLazyCounter, 5860 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 5235 SdHoareTripleChecker+Invalid, 7314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 5860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1331 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:57:16,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 5235 Invalid, 7314 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 5860 Invalid, 0 Unknown, 1331 Unchecked, 5.1s Time] [2023-11-24 23:57:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42600 states. [2023-11-24 23:57:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42600 to 27941. [2023-11-24 23:57:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27941 states, 27903 states have (on average 2.791922015553883) internal successors, (77903), 27940 states have internal predecessors, (77903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27941 states to 27941 states and 77903 transitions. [2023-11-24 23:57:17,006 INFO L78 Accepts]: Start accepts. Automaton has 27941 states and 77903 transitions. Word has length 62 [2023-11-24 23:57:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:57:17,006 INFO L495 AbstractCegarLoop]: Abstraction has 27941 states and 77903 transitions. [2023-11-24 23:57:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.268292682926829) internal successors, (134), 42 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:57:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27941 states and 77903 transitions. [2023-11-24 23:57:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-24 23:57:17,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:57:17,010 INFO L195 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] [2023-11-24 23:57:17,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:57:17,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:57:17,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-24 23:57:17,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:57:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2130399099, now seen corresponding path program 1 times [2023-11-24 23:57:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:57:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824881793] [2023-11-24 23:57:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:57:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:18,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:57:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824881793] [2023-11-24 23:57:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824881793] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:57:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733537270] [2023-11-24 23:57:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:57:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:57:18,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:57:18,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:57:18,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35fd6d33-a266-4db2-a1f8-5bc40b9acf77/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:57:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:57:18,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-24 23:57:18,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:57:18,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:57:18,426 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 23:57:18,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 23:57:18,516 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-24 23:57:18,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-24 23:57:18,723 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 23:57:18,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-24 23:57:18,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-24 23:57:18,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 23:57:18,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-24 23:57:18,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-24 23:57:18,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:18,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-24 23:57:18,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:18,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-24 23:57:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:18,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:57:18,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_615) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_615) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false [2023-11-24 23:57:18,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_615) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_615) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)))))) is different from false [2023-11-24 23:57:19,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:19,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-11-24 23:57:19,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:57:19,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31 [2023-11-24 23:57:19,023 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-24 23:57:19,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 1 [2023-11-24 23:57:19,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-11-24 23:57:19,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-24 23:57:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:57:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733537270] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:57:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889593480] [2023-11-24 23:57:19,393 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-24 23:57:19,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:57:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 32 [2023-11-24 23:57:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068054123] [2023-11-24 23:57:19,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:57:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 23:57:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:57:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 23:57:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=808, Unknown=27, NotChecked=118, Total=1056 [2023-11-24 23:57:19,400 INFO L87 Difference]: Start difference. First operand 27941 states and 77903 transitions. Second operand has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 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)