./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_safe-12-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/fib_safe-12-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ --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 d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:58:57,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:58:57,665 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-19 04:58:57,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:58:57,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:58:57,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:58:57,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:58:57,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:58:57,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:58:57,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:58:57,742 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:58:57,744 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:58:57,744 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:58:57,746 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:58:57,746 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:58:57,747 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:58:57,747 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:58:57,748 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:58:57,748 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:58:57,748 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:58:57,750 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:58:57,751 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:58:57,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:58:57,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:58:57,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:58:57,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:58:57,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:58:57,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:58:57,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:58:57,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:58:57,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:58:57,756 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 04:58:57,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:58:57,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:58:57,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:58:57,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:58:57,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:58:57,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:58:57,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:58:57,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:58:57,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:58:57,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:58:57,759 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:58:57,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:58:57,760 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:58:57,760 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:58:57,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:58:57,761 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_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/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_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ 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 -> d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 [2023-11-19 04:58:58,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:58:58,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:58:58,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:58:58,083 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:58:58,084 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:58:58,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread/fib_safe-12-racy.i [2023-11-19 04:59:01,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:59:01,700 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:59:01,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/sv-benchmarks/c/pthread/fib_safe-12-racy.i [2023-11-19 04:59:01,735 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/data/78b236f30/de4c4d78e887476d947e7815f6f09931/FLAGd1e937e4c [2023-11-19 04:59:01,750 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/data/78b236f30/de4c4d78e887476d947e7815f6f09931 [2023-11-19 04:59:01,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:59:01,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:59:01,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:59:01,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:59:01,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:59:01,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:59:01" (1/1) ... [2023-11-19 04:59:01,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7779be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:01, skipping insertion in model container [2023-11-19 04:59:01,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:59:01" (1/1) ... [2023-11-19 04:59:01,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:59:02,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:59:02,244 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:59:02,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:59:02,353 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:59:02,353 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:59:02,361 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:59:02,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02 WrapperNode [2023-11-19 04:59:02,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:59:02,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:59:02,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:59:02,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:59:02,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,438 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2023-11-19 04:59:02,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:59:02,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:59:02,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:59:02,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:59:02,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:59:02,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:59:02,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:59:02,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:59:02,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (1/1) ... [2023-11-19 04:59:02,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:59:02,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:02,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:59:02,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:59:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-19 04:59:02,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-19 04:59:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-19 04:59:02,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-19 04:59:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:59:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:59:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:59:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:59:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:59:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:59:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:59:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:59:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:59:02,573 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:59:02,748 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:59:02,751 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:59:03,134 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:59:03,203 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:59:03,203 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 04:59:03,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:03 BoogieIcfgContainer [2023-11-19 04:59:03,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:59:03,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:59:03,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:59:03,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:59:03,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:59:01" (1/3) ... [2023-11-19 04:59:03,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4a74f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:59:03, skipping insertion in model container [2023-11-19 04:59:03,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:02" (2/3) ... [2023-11-19 04:59:03,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4a74f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:59:03, skipping insertion in model container [2023-11-19 04:59:03,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:03" (3/3) ... [2023-11-19 04:59:03,227 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-12-racy.i [2023-11-19 04:59:03,236 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:59:03,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:59:03,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-19 04:59:03,245 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:59:03,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:59:03,360 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:59:03,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 194 transitions, 396 flow [2023-11-19 04:59:03,379 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 194 transitions, 396 flow [2023-11-19 04:59:03,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 194 transitions, 396 flow [2023-11-19 04:59:03,489 INFO L124 PetriNetUnfolderBase]: 9/192 cut-off events. [2023-11-19 04:59:03,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:59:03,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 192 events. 9/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 393 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2023-11-19 04:59:03,509 INFO L119 LiptonReduction]: Number of co-enabled transitions 13680 [2023-11-19 04:59:08,508 INFO L134 LiptonReduction]: Checked pairs total: 15075 [2023-11-19 04:59:08,509 INFO L136 LiptonReduction]: Total number of compositions: 226 [2023-11-19 04:59:08,520 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 50 transitions, 108 flow [2023-11-19 04:59:08,655 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 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-19 04:59:08,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:59:08,685 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;@a9b3038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:59:08,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-19 04:59:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 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-19 04:59:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:59:08,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:08,701 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:59:08,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:08,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 792, now seen corresponding path program 1 times [2023-11-19 04:59:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137258399] [2023-11-19 04:59:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:08,867 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-19 04:59:08,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137258399] [2023-11-19 04:59:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137258399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:59:08,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382628357] [2023-11-19 04:59:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:08,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:59:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:59:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:59:08,919 INFO L87 Difference]: Start difference. First operand has 2122 states, 1161 states have (on average 5.544358311800172) internal successors, (6437), 2121 states have internal predecessors, (6437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-19 04:59:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:08,980 INFO L93 Difference]: Finished difference Result 87 states and 251 transitions. [2023-11-19 04:59:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:59:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2023-11-19 04:59:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:08,996 INFO L225 Difference]: With dead ends: 87 [2023-11-19 04:59:08,996 INFO L226 Difference]: Without dead ends: 71 [2023-11-19 04:59:08,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:59:09,004 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:09,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:59:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-19 04:59:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-19 04:59:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 2.9420289855072466) internal successors, (203), 70 states have internal predecessors, (203), 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-19 04:59:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 203 transitions. [2023-11-19 04:59:09,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 203 transitions. Word has length 1 [2023-11-19 04:59:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:09,064 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 203 transitions. [2023-11-19 04:59:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-19 04:59:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 203 transitions. [2023-11-19 04:59:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:59:09,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:09,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:09,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:59:09,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:09,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1054603087, now seen corresponding path program 1 times [2023-11-19 04:59:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583486652] [2023-11-19 04:59:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:09,287 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-19 04:59:09,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583486652] [2023-11-19 04:59:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583486652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:59:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357884009] [2023-11-19 04:59:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:59:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:59:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:09,291 INFO L87 Difference]: Start difference. First operand 71 states and 203 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-19 04:59:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:09,338 INFO L93 Difference]: Finished difference Result 80 states and 230 transitions. [2023-11-19 04:59:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:59:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-19 04:59:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:09,348 INFO L225 Difference]: With dead ends: 80 [2023-11-19 04:59:09,348 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 04:59:09,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:09,350 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:09,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:59:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 04:59:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-19 04:59:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.948717948717949) internal successors, (230), 79 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 230 transitions. [2023-11-19 04:59:09,363 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 230 transitions. Word has length 7 [2023-11-19 04:59:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:09,363 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 230 transitions. [2023-11-19 04:59:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-19 04:59:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 230 transitions. [2023-11-19 04:59:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:59:09,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:09,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:09,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:59:09,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:09,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1667012137, now seen corresponding path program 1 times [2023-11-19 04:59:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278297966] [2023-11-19 04:59:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:09,465 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-19 04:59:09,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278297966] [2023-11-19 04:59:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278297966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:59:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796634337] [2023-11-19 04:59:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:09,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:09,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:59:09,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:59:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:09,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 04:59:09,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:09,617 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-19 04:59:09,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:59:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796634337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:09,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:59:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-19 04:59:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622951516] [2023-11-19 04:59:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:59:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:59:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:09,622 INFO L87 Difference]: Start difference. First operand 80 states and 230 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 04:59:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:09,680 INFO L93 Difference]: Finished difference Result 123 states and 355 transitions. [2023-11-19 04:59:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:59:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-19 04:59:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:09,685 INFO L225 Difference]: With dead ends: 123 [2023-11-19 04:59:09,686 INFO L226 Difference]: Without dead ends: 123 [2023-11-19 04:59:09,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:09,690 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:09,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:59:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-19 04:59:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2023-11-19 04:59:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 2.950617283950617) internal successors, (239), 82 states have internal predecessors, (239), 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-19 04:59:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 239 transitions. [2023-11-19 04:59:09,714 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 239 transitions. Word has length 8 [2023-11-19 04:59:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:09,715 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 239 transitions. [2023-11-19 04:59:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 04:59:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 239 transitions. [2023-11-19 04:59:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:59:09,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:09,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:09,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:59:09,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:09,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:09,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1185640350, now seen corresponding path program 1 times [2023-11-19 04:59:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868931030] [2023-11-19 04:59:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:10,090 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-19 04:59:10,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:10,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868931030] [2023-11-19 04:59:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868931030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:59:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258606327] [2023-11-19 04:59:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:10,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:59:10,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:59:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:10,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 04:59:10,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:10,255 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-19 04:59:10,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:59:10,274 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-19 04:59:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258606327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:59:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1510283758] [2023-11-19 04:59:10,283 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-19 04:59:10,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:59:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-19 04:59:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410146246] [2023-11-19 04:59:10,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:59:10,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:59:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:10,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:59:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:59:10,291 INFO L87 Difference]: Start difference. First operand 83 states and 239 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-19 04:59:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:10,369 INFO L93 Difference]: Finished difference Result 110 states and 320 transitions. [2023-11-19 04:59:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:59:10,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 10 [2023-11-19 04:59:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:10,372 INFO L225 Difference]: With dead ends: 110 [2023-11-19 04:59:10,373 INFO L226 Difference]: Without dead ends: 110 [2023-11-19 04:59:10,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:59:10,377 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:10,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-19 04:59:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-19 04:59:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 2.962962962962963) internal successors, (320), 109 states have internal predecessors, (320), 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-19 04:59:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 320 transitions. [2023-11-19 04:59:10,427 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 320 transitions. Word has length 10 [2023-11-19 04:59:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:10,428 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 320 transitions. [2023-11-19 04:59:10,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-19 04:59:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 320 transitions. [2023-11-19 04:59:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:59:10,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:10,431 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:10,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:59:10,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:10,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:10,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1000412536, now seen corresponding path program 2 times [2023-11-19 04:59:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561267820] [2023-11-19 04:59:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:10,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561267820] [2023-11-19 04:59:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561267820] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:59:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743548519] [2023-11-19 04:59:10,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:59:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:10,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:59:10,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:59:10,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:59:10,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:59:10,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:59:10,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:10,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:59:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743548519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:59:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897890109] [2023-11-19 04:59:11,038 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-19 04:59:11,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:59:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-19 04:59:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478795942] [2023-11-19 04:59:11,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:59:11,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 04:59:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 04:59:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:59:11,042 INFO L87 Difference]: Start difference. First operand 110 states and 320 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-19 04:59:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:11,195 INFO L93 Difference]: Finished difference Result 164 states and 482 transitions. [2023-11-19 04:59:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 04:59:11,196 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 13 [2023-11-19 04:59:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:11,198 INFO L225 Difference]: With dead ends: 164 [2023-11-19 04:59:11,198 INFO L226 Difference]: Without dead ends: 164 [2023-11-19 04:59:11,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-19 04:59:11,199 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:11,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 21 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-19 04:59:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-11-19 04:59:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.9753086419753085) internal successors, (482), 163 states have internal predecessors, (482), 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-19 04:59:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 482 transitions. [2023-11-19 04:59:11,210 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 482 transitions. Word has length 13 [2023-11-19 04:59:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:11,211 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 482 transitions. [2023-11-19 04:59:11,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-19 04:59:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 482 transitions. [2023-11-19 04:59:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:59:11,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:11,214 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:11,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:59:11,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:11,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:11,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 70405432, now seen corresponding path program 3 times [2023-11-19 04:59:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786496660] [2023-11-19 04:59:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:11,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786496660] [2023-11-19 04:59:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786496660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:59:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211324637] [2023-11-19 04:59:11,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 04:59:11,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:11,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:11,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:59:11,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:59:11,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 04:59:11,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:59:11,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 04:59:11,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:11,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:59:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211324637] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:59:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988127894] [2023-11-19 04:59:12,111 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-19 04:59:12,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:59:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-19 04:59:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087609958] [2023-11-19 04:59:12,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:59:12,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 04:59:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 04:59:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-19 04:59:12,115 INFO L87 Difference]: Start difference. First operand 164 states and 482 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:12,465 INFO L93 Difference]: Finished difference Result 272 states and 806 transitions. [2023-11-19 04:59:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-19 04:59:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 04:59:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:12,469 INFO L225 Difference]: With dead ends: 272 [2023-11-19 04:59:12,469 INFO L226 Difference]: Without dead ends: 272 [2023-11-19 04:59:12,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-19 04:59:12,471 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 351 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:12,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 15 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:59:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-19 04:59:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-11-19 04:59:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 2.9851851851851854) internal successors, (806), 271 states have internal predecessors, (806), 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-19 04:59:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 806 transitions. [2023-11-19 04:59:12,503 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 806 transitions. Word has length 19 [2023-11-19 04:59:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:12,503 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 806 transitions. [2023-11-19 04:59:12,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 806 transitions. [2023-11-19 04:59:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 04:59:12,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:12,513 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:12,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:59:12,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 04:59:12,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:12,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -14267208, now seen corresponding path program 4 times [2023-11-19 04:59:12,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:12,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666817895] [2023-11-19 04:59:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:12,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:13,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666817895] [2023-11-19 04:59:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666817895] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:59:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261632265] [2023-11-19 04:59:13,363 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 04:59:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:13,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:59:13,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:59:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:13,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 04:59:13,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:59:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:13,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:59:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261632265] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:59:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556227477] [2023-11-19 04:59:14,033 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-19 04:59:14,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:59:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 29 [2023-11-19 04:59:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887537964] [2023-11-19 04:59:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:59:14,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 04:59:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 04:59:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2023-11-19 04:59:14,038 INFO L87 Difference]: Start difference. First operand 272 states and 806 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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-19 04:59:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:14,344 INFO L93 Difference]: Finished difference Result 308 states and 914 transitions. [2023-11-19 04:59:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-19 04:59:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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 31 [2023-11-19 04:59:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:14,348 INFO L225 Difference]: With dead ends: 308 [2023-11-19 04:59:14,349 INFO L226 Difference]: Without dead ends: 308 [2023-11-19 04:59:14,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 20 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2023-11-19 04:59:14,350 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 366 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:14,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 21 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:59:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-19 04:59:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-11-19 04:59:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 306 states have (on average 2.9869281045751634) internal successors, (914), 307 states have internal predecessors, (914), 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-19 04:59:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 914 transitions. [2023-11-19 04:59:14,368 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 914 transitions. Word has length 31 [2023-11-19 04:59:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 914 transitions. [2023-11-19 04:59:14,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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-19 04:59:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 914 transitions. [2023-11-19 04:59:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 04:59:14,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:14,371 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:14,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:59:14,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:59:14,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-19 04:59:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1948616904, now seen corresponding path program 5 times [2023-11-19 04:59:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950176681] [2023-11-19 04:59:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:59:14,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:59:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:59:14,848 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:59:14,848 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:59:14,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2023-11-19 04:59:14,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2023-11-19 04:59:14,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2023-11-19 04:59:14,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2023-11-19 04:59:14,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2023-11-19 04:59:14,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2023-11-19 04:59:14,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2023-11-19 04:59:14,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2023-11-19 04:59:14,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2023-11-19 04:59:14,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2023-11-19 04:59:14,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2023-11-19 04:59:14,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2023-11-19 04:59:14,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2023-11-19 04:59:14,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2023-11-19 04:59:14,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2023-11-19 04:59:14,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2023-11-19 04:59:14,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2023-11-19 04:59:14,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2023-11-19 04:59:14,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2023-11-19 04:59:14,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2023-11-19 04:59:14,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2023-11-19 04:59:14,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2023-11-19 04:59:14,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2023-11-19 04:59:14,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2023-11-19 04:59:14,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2023-11-19 04:59:14,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2023-11-19 04:59:14,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2023-11-19 04:59:14,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2023-11-19 04:59:14,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2023-11-19 04:59:14,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2023-11-19 04:59:14,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2023-11-19 04:59:14,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2023-11-19 04:59:14,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2023-11-19 04:59:14,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2023-11-19 04:59:14,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2023-11-19 04:59:14,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2023-11-19 04:59:14,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2023-11-19 04:59:14,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2023-11-19 04:59:14,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2023-11-19 04:59:14,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2023-11-19 04:59:14,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2023-11-19 04:59:14,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2023-11-19 04:59:14,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2023-11-19 04:59:14,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2023-11-19 04:59:14,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2023-11-19 04:59:14,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2023-11-19 04:59:14,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:59:14,865 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-11-19 04:59:14,873 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:59:14,873 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:59:14,978 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-19 04:59:14,980 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-19 04:59:15,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:59:15 BasicIcfg [2023-11-19 04:59:15,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:59:15,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:59:15,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:59:15,025 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:59:15,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:03" (3/4) ... [2023-11-19 04:59:15,027 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:59:15,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:59:15,031 INFO L158 Benchmark]: Toolchain (without parser) took 13276.76ms. Allocated memory was 153.1MB in the beginning and 245.4MB in the end (delta: 92.3MB). Free memory was 106.0MB in the beginning and 114.3MB in the end (delta: -8.3MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2023-11-19 04:59:15,031 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:59:15,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.95ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 86.0MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 04:59:15,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.15ms. Allocated memory is still 153.1MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:59:15,032 INFO L158 Benchmark]: Boogie Preprocessor took 35.27ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:59:15,033 INFO L158 Benchmark]: RCFGBuilder took 739.24ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 81.9MB in the beginning and 166.0MB in the end (delta: -84.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-19 04:59:15,033 INFO L158 Benchmark]: TraceAbstraction took 11805.59ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 166.0MB in the beginning and 114.3MB in the end (delta: 51.7MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2023-11-19 04:59:15,033 INFO L158 Benchmark]: Witness Printer took 7.04ms. Allocated memory is still 245.4MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:59:15,036 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.95ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 86.0MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.15ms. Allocated memory is still 153.1MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.27ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 739.24ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 81.9MB in the beginning and 166.0MB in the end (delta: -84.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11805.59ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 166.0MB in the beginning and 114.3MB in the end (delta: 51.7MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * Witness Printer took 7.04ms. Allocated memory is still 245.4MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 192 PlacesBefore, 53 PlacesAfterwards, 194 TransitionsBefore, 50 TransitionsAfterwards, 13680 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 173 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 226 TotalNumberOfCompositions, 15075 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13200, independent: 13085, independent conditional: 0, independent unconditional: 13085, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8588, independent: 8535, independent conditional: 0, independent unconditional: 8535, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8588, independent: 8440, independent conditional: 0, independent unconditional: 8440, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 148, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13200, independent: 4550, independent conditional: 0, independent unconditional: 4550, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 8588, unknown conditional: 0, unknown unconditional: 8588] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 725]: Data race detected [2023-11-19 04:59:15,068 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-19 04:59:15,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-19 04:59:15,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-19 04:59:15,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated Data race detected The following path leads to a data race: [L683] 0 int i, j; [L686] 0 int p, q; [L703] 0 int cur = 1, prev = 0, next = 0; [L704] 0 int x; [L714] 0 pthread_t id1, id2; [L716] 0 i = 1 [L719] 0 j = 1 [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=196419, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=196419, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, cur=1, i=1, id1={3:0}, id2={5:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] 0 x < 26 [L706] COND TRUE 0 x < 26 [L707] EXPR 0 prev + cur [L707] 0 next = prev + cur [L708] 0 prev = cur [L709] 0 cur = next [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] 0 x < 26 [L706] COND FALSE 0 !(x < 26) [L711] 0 return prev; [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); [L725] 0 i <= correct VAL [\old(argc)=196419, arg={0:0}, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, correct=121393, cur=196418, i=1, id1={3:0}, id2={5:0}, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p < 12 [L688] COND TRUE 1 p < 12 [L690] EXPR 1 i + j [L690] 1 i = i + j [L688] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=2, j=1, next=196418, p=1, prev=121393, q=0, x=26] [L725] 0 i <= correct VAL [\old(argc)=196419, arg={0:0}, arg={0:0}, arg={0:0}, argc=196419, argv={196420:196421}, argv={196420:196421}, correct=121393, cur=196418, i=2, id1={3:0}, id2={5:0}, j=1, next=196418, p=1, prev=121393, q=0, x=26] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 21 mSDtfsCounter, 611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 111 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=0, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1055 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 1/959 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 04:59:15,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de898a-2afa-49f1-8751-a5b136772695/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE