./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/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_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:12:28,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:12:28,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:12:28,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:12:28,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:12:28,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:12:28,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:12:28,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:12:28,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:12:28,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:12:28,678 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:12:28,678 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:12:28,679 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:12:28,681 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:12:28,681 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:12:28,682 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:12:28,682 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:12:28,682 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:12:28,683 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:12:28,684 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:12:28,684 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:12:28,685 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:12:28,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:12:28,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:12:28,687 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:12:28,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:12:28,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:12:28,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:12:28,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:12:28,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:12:28,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:12:28,691 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:12:28,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:12:28,692 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:12:28,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:12:28,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:12:28,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:28,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:12:28,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:12:28,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:12:28,694 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:12:28,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:12:28,695 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:12:28,695 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:12:28,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:12:28,696 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_12565d2c-f1bb-42be-b9f5-5790c655da83/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_12565d2c-f1bb-42be-b9f5-5790c655da83/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 ! call(reach_error())) ) 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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 [2023-11-19 04:12:29,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:12:29,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:12:29,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:12:29,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:12:29,092 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:12:29,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2023-11-19 04:12:32,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:12:32,617 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:12:32,624 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2023-11-19 04:12:32,643 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/data/a5c885c79/e111d4da17764c4884b2ffb40f8635c4/FLAGc3cad44ad [2023-11-19 04:12:32,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/data/a5c885c79/e111d4da17764c4884b2ffb40f8635c4 [2023-11-19 04:12:32,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:12:32,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:12:32,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:32,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:12:32,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:12:32,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:32" (1/1) ... [2023-11-19 04:12:32,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f6fa6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:32, skipping insertion in model container [2023-11-19 04:12:32,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:32" (1/1) ... [2023-11-19 04:12:32,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:12:32,929 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2023-11-19 04:12:33,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:33,169 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:12:33,182 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2023-11-19 04:12:33,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:33,336 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:12:33,336 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:12:33,364 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:12:33,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33 WrapperNode [2023-11-19 04:12:33,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:33,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:33,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:12:33,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:12:33,375 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:12:33" (1/1) ... [2023-11-19 04:12:33,417 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:12:33" (1/1) ... [2023-11-19 04:12:33,478 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2023-11-19 04:12:33,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:33,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:12:33,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:12:33,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:12:33,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:12:33,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:12:33,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:12:33,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:12:33,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (1/1) ... [2023-11-19 04:12:33,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:33,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/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:12:33,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/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:12:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:12:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:12:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:12:33,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:12:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:12:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:12:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:12:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:12:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:12:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:12:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:12:33,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:12:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 04:12:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 04:12:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:12:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:12:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:12:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:12:33,665 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:12:33,889 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:12:33,891 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:12:34,454 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:12:34,970 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:12:34,971 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:12:34,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:34 BoogieIcfgContainer [2023-11-19 04:12:34,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:12:34,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:12:34,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:12:34,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:12:34,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:12:32" (1/3) ... [2023-11-19 04:12:34,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b14a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:34, skipping insertion in model container [2023-11-19 04:12:34,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:33" (2/3) ... [2023-11-19 04:12:34,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b14a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:34, skipping insertion in model container [2023-11-19 04:12:34,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:34" (3/3) ... [2023-11-19 04:12:34,990 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-11-19 04:12:34,999 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:12:35,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:12:35,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 04:12:35,011 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:12:35,110 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:12:35,148 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:12:35,163 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 155 transitions, 326 flow [2023-11-19 04:12:35,166 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 155 transitions, 326 flow [2023-11-19 04:12:35,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 155 transitions, 326 flow [2023-11-19 04:12:35,243 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-11-19 04:12:35,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:12:35,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 3/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-11-19 04:12:35,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 3388 [2023-11-19 04:12:45,611 INFO L134 LiptonReduction]: Checked pairs total: 8731 [2023-11-19 04:12:45,612 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-19 04:12:45,620 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 34 transitions, 84 flow [2023-11-19 04:12:45,863 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2874 states, 2871 states have (on average 4.193660745384883) internal successors, (12040), 2873 states have internal predecessors, (12040), 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:12:45,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:12:45,890 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;@5219dc7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:12:45,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 04:12:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 2874 states, 2871 states have (on average 4.193660745384883) internal successors, (12040), 2873 states have internal predecessors, (12040), 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:12:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:12:45,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:45,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:45,912 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:45,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1959122926, now seen corresponding path program 1 times [2023-11-19 04:12:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054165485] [2023-11-19 04:12:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:46,497 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:12:46,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054165485] [2023-11-19 04:12:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054165485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:12:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916728847] [2023-11-19 04:12:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:46,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:46,543 INFO L87 Difference]: Start difference. First operand has 2874 states, 2871 states have (on average 4.193660745384883) internal successors, (12040), 2873 states have internal predecessors, (12040), 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 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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:12:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:46,709 INFO L93 Difference]: Finished difference Result 2362 states and 9032 transitions. [2023-11-19 04:12:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:46,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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:12:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:46,752 INFO L225 Difference]: With dead ends: 2362 [2023-11-19 04:12:46,752 INFO L226 Difference]: Without dead ends: 2202 [2023-11-19 04:12:46,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:12:46,756 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:46,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2023-11-19 04:12:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2023-11-19 04:12:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 3.8273512039981825) internal successors, (8424), 2201 states have internal predecessors, (8424), 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:12:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2023-11-19 04:12:46,994 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 8 [2023-11-19 04:12:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2023-11-19 04:12:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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:12:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2023-11-19 04:12:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:12:47,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:47,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:47,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:12:47,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:47,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -526343973, now seen corresponding path program 1 times [2023-11-19 04:12:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:47,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708506713] [2023-11-19 04:12:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:47,268 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:12:47,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708506713] [2023-11-19 04:12:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708506713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722672731] [2023-11-19 04:12:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:47,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:47,271 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:12:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:47,494 INFO L93 Difference]: Finished difference Result 2402 states and 8894 transitions. [2023-11-19 04:12:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-11-19 04:12:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:47,518 INFO L225 Difference]: With dead ends: 2402 [2023-11-19 04:12:47,519 INFO L226 Difference]: Without dead ends: 2002 [2023-11-19 04:12:47,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:47,520 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:47,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:12:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2023-11-19 04:12:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 2002. [2023-11-19 04:12:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 3.7751124437781107) internal successors, (7554), 2001 states have internal predecessors, (7554), 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:12:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 7554 transitions. [2023-11-19 04:12:47,634 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 7554 transitions. Word has length 12 [2023-11-19 04:12:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:47,634 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 7554 transitions. [2023-11-19 04:12:47,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:12:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 7554 transitions. [2023-11-19 04:12:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:12:47,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:47,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:47,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:12:47,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:47,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 863178750, now seen corresponding path program 1 times [2023-11-19 04:12:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731617822] [2023-11-19 04:12:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:47,988 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:12:47,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731617822] [2023-11-19 04:12:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731617822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:47,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156088137] [2023-11-19 04:12:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:47,992 INFO L87 Difference]: Start difference. First operand 2002 states and 7554 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:12:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:48,246 INFO L93 Difference]: Finished difference Result 2524 states and 9228 transitions. [2023-11-19 04:12:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:12:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:48,261 INFO L225 Difference]: With dead ends: 2524 [2023-11-19 04:12:48,261 INFO L226 Difference]: Without dead ends: 1180 [2023-11-19 04:12:48,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:12:48,263 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:48,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:12:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2023-11-19 04:12:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2023-11-19 04:12:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 3.469041560644614) internal successors, (4090), 1179 states have internal predecessors, (4090), 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:12:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 4090 transitions. [2023-11-19 04:12:48,333 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 4090 transitions. Word has length 13 [2023-11-19 04:12:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:48,333 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 4090 transitions. [2023-11-19 04:12:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:12:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 4090 transitions. [2023-11-19 04:12:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:12:48,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:48,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:48,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:12:48,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:48,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1115545294, now seen corresponding path program 1 times [2023-11-19 04:12:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902574934] [2023-11-19 04:12:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:48,603 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:12:48,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:48,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902574934] [2023-11-19 04:12:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902574934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930738880] [2023-11-19 04:12:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:48,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:48,612 INFO L87 Difference]: Start difference. First operand 1180 states and 4090 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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:12:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:48,813 INFO L93 Difference]: Finished difference Result 1615 states and 5538 transitions. [2023-11-19 04:12:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15 [2023-11-19 04:12:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:48,820 INFO L225 Difference]: With dead ends: 1615 [2023-11-19 04:12:48,820 INFO L226 Difference]: Without dead ends: 676 [2023-11-19 04:12:48,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:12:48,822 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 13 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:12:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2023-11-19 04:12:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2023-11-19 04:12:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.3362962962962963) internal successors, (2252), 675 states have internal predecessors, (2252), 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:12:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2252 transitions. [2023-11-19 04:12:48,850 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 2252 transitions. Word has length 15 [2023-11-19 04:12:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:48,850 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 2252 transitions. [2023-11-19 04:12:48,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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:12:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 2252 transitions. [2023-11-19 04:12:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:12:48,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:48,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:48,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:12:48,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:48,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1245315452, now seen corresponding path program 1 times [2023-11-19 04:12:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541185362] [2023-11-19 04:12:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:49,137 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:12:49,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541185362] [2023-11-19 04:12:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541185362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864698638] [2023-11-19 04:12:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:49,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:49,139 INFO L87 Difference]: Start difference. First operand 676 states and 2252 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:12:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:49,266 INFO L93 Difference]: Finished difference Result 730 states and 2369 transitions. [2023-11-19 04:12:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2023-11-19 04:12:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:49,273 INFO L225 Difference]: With dead ends: 730 [2023-11-19 04:12:49,273 INFO L226 Difference]: Without dead ends: 640 [2023-11-19 04:12:49,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:49,274 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:49,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2023-11-19 04:12:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2023-11-19 04:12:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.30829420970266) internal successors, (2114), 639 states have internal predecessors, (2114), 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:12:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 2114 transitions. [2023-11-19 04:12:49,300 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 2114 transitions. Word has length 17 [2023-11-19 04:12:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:49,301 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 2114 transitions. [2023-11-19 04:12:49,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:12:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 2114 transitions. [2023-11-19 04:12:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:12:49,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:49,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:49,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:12:49,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:49,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash 902688901, now seen corresponding path program 1 times [2023-11-19 04:12:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998472513] [2023-11-19 04:12:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:49,657 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:12:49,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998472513] [2023-11-19 04:12:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998472513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:49,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:49,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182666961] [2023-11-19 04:12:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:49,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:49,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:49,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:49,660 INFO L87 Difference]: Start difference. First operand 640 states and 2114 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:12:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:49,827 INFO L93 Difference]: Finished difference Result 808 states and 2628 transitions. [2023-11-19 04:12:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2023-11-19 04:12:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:49,831 INFO L225 Difference]: With dead ends: 808 [2023-11-19 04:12:49,832 INFO L226 Difference]: Without dead ends: 344 [2023-11-19 04:12:49,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:12:49,833 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:49,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-19 04:12:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-11-19 04:12:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.072886297376093) internal successors, (1054), 343 states have internal predecessors, (1054), 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:12:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1054 transitions. [2023-11-19 04:12:49,848 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1054 transitions. Word has length 18 [2023-11-19 04:12:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:49,848 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 1054 transitions. [2023-11-19 04:12:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:12:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1054 transitions. [2023-11-19 04:12:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:12:49,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:49,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:12:49,850 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:49,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1473448516, now seen corresponding path program 1 times [2023-11-19 04:12:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175406839] [2023-11-19 04:12:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:50,189 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:12:50,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175406839] [2023-11-19 04:12:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175406839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367141950] [2023-11-19 04:12:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:50,192 INFO L87 Difference]: Start difference. First operand 344 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:12:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:50,252 INFO L93 Difference]: Finished difference Result 296 states and 850 transitions. [2023-11-19 04:12:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:50,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:12:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:50,255 INFO L225 Difference]: With dead ends: 296 [2023-11-19 04:12:50,255 INFO L226 Difference]: Without dead ends: 296 [2023-11-19 04:12:50,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:50,258 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-19 04:12:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2023-11-19 04:12:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.8813559322033897) internal successors, (850), 295 states have internal predecessors, (850), 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:12:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 850 transitions. [2023-11-19 04:12:50,271 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 850 transitions. Word has length 19 [2023-11-19 04:12:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:50,271 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 850 transitions. [2023-11-19 04:12:50,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:12:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 850 transitions. [2023-11-19 04:12:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:50,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:50,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:50,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:12:50,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:50,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1679319872, now seen corresponding path program 1 times [2023-11-19 04:12:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885335269] [2023-11-19 04:12:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:50,565 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:12:50,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885335269] [2023-11-19 04:12:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885335269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:50,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:50,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617678402] [2023-11-19 04:12:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:50,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:50,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:50,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:50,568 INFO L87 Difference]: Start difference. First operand 296 states and 850 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:12:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:50,645 INFO L93 Difference]: Finished difference Result 202 states and 494 transitions. [2023-11-19 04:12:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:12:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-11-19 04:12:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:50,648 INFO L225 Difference]: With dead ends: 202 [2023-11-19 04:12:50,648 INFO L226 Difference]: Without dead ends: 202 [2023-11-19 04:12:50,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:50,651 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:50,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-19 04:12:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-11-19 04:12:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.45771144278607) internal successors, (494), 201 states have internal predecessors, (494), 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:12:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 494 transitions. [2023-11-19 04:12:50,660 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 494 transitions. Word has length 20 [2023-11-19 04:12:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:50,661 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 494 transitions. [2023-11-19 04:12:50,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:12:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 494 transitions. [2023-11-19 04:12:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 04:12:50,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:50,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:50,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:12:50,665 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:50,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -41959938, now seen corresponding path program 1 times [2023-11-19 04:12:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446808881] [2023-11-19 04:12:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:50,970 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:12:50,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446808881] [2023-11-19 04:12:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446808881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004923228] [2023-11-19 04:12:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:50,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:50,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:50,973 INFO L87 Difference]: Start difference. First operand 202 states and 494 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:12:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:51,082 INFO L93 Difference]: Finished difference Result 122 states and 258 transitions. [2023-11-19 04:12:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 21 [2023-11-19 04:12:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:51,083 INFO L225 Difference]: With dead ends: 122 [2023-11-19 04:12:51,084 INFO L226 Difference]: Without dead ends: 122 [2023-11-19 04:12:51,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:51,084 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:51,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-19 04:12:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-19 04:12:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.1322314049586777) internal successors, (258), 121 states have internal predecessors, (258), 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:12:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 258 transitions. [2023-11-19 04:12:51,090 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 258 transitions. Word has length 21 [2023-11-19 04:12:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:51,090 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 258 transitions. [2023-11-19 04:12:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:12:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 258 transitions. [2023-11-19 04:12:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:12:51,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:51,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:12:51,091 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:51,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash -274241283, now seen corresponding path program 1 times [2023-11-19 04:12:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:51,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614128347] [2023-11-19 04:12:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:51,412 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:12:51,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614128347] [2023-11-19 04:12:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614128347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:12:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654363763] [2023-11-19 04:12:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:51,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:51,414 INFO L87 Difference]: Start difference. First operand 122 states and 258 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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:12:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:51,516 INFO L93 Difference]: Finished difference Result 92 states and 198 transitions. [2023-11-19 04:12:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2023-11-19 04:12:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:51,518 INFO L225 Difference]: With dead ends: 92 [2023-11-19 04:12:51,518 INFO L226 Difference]: Without dead ends: 92 [2023-11-19 04:12:51,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:51,519 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:51,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 6 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-19 04:12:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-19 04:12:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1758241758241756) internal successors, (198), 91 states have internal predecessors, (198), 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:12:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2023-11-19 04:12:51,523 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 23 [2023-11-19 04:12:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:51,523 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2023-11-19 04:12:51,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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:12:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2023-11-19 04:12:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:12:51,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:51,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:12:51,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:12:51,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1519917249, now seen corresponding path program 1 times [2023-11-19 04:12:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752030076] [2023-11-19 04:12:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:12:51,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:12:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:12:51,842 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:12:51,843 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:12:51,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 04:12:51,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 04:12:51,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 04:12:51,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 04:12:51,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 04:12:51,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 04:12:51,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 04:12:51,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:12:51,850 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:51,855 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:12:51,855 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:12:51,965 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 04:12:51,967 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 04:12:51,969 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-19 04:12:51,971 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-19 04:12:52,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:12:51 BasicIcfg [2023-11-19 04:12:52,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:12:52,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:12:52,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:12:52,001 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:12:52,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:34" (3/4) ... [2023-11-19 04:12:52,002 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 04:12:52,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-19 04:12:52,046 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-19 04:12:52,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-19 04:12:52,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated [2023-11-19 04:12:52,153 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:12:52,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:12:52,154 INFO L158 Benchmark]: Toolchain (without parser) took 19489.75ms. Allocated memory was 109.1MB in the beginning and 249.6MB in the end (delta: 140.5MB). Free memory was 69.6MB in the beginning and 135.5MB in the end (delta: -65.9MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,154 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:12:52,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.16ms. Allocated memory was 109.1MB in the beginning and 172.0MB in the end (delta: 62.9MB). Free memory was 69.4MB in the beginning and 141.2MB in the end (delta: -71.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.09ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 138.9MB in the end (delta: 2.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,156 INFO L158 Benchmark]: Boogie Preprocessor took 73.22ms. Allocated memory is still 172.0MB. Free memory was 138.9MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,162 INFO L158 Benchmark]: RCFGBuilder took 1421.84ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 110.3MB in the end (delta: 26.4MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,163 INFO L158 Benchmark]: TraceAbstraction took 17018.14ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 110.3MB in the beginning and 156.5MB in the end (delta: -46.1MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,164 INFO L158 Benchmark]: Witness Printer took 152.56ms. Allocated memory is still 249.6MB. Free memory was 156.5MB in the beginning and 135.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 04:12:52,166 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.35ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.16ms. Allocated memory was 109.1MB in the beginning and 172.0MB in the end (delta: 62.9MB). Free memory was 69.4MB in the beginning and 141.2MB in the end (delta: -71.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.09ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 138.9MB in the end (delta: 2.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.22ms. Allocated memory is still 172.0MB. Free memory was 138.9MB in the beginning and 136.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1421.84ms. Allocated memory is still 172.0MB. Free memory was 136.7MB in the beginning and 110.3MB in the end (delta: 26.4MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17018.14ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 110.3MB in the beginning and 156.5MB in the end (delta: -46.1MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. * Witness Printer took 152.56ms. Allocated memory is still 249.6MB. Free memory was 156.5MB in the beginning and 135.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre31 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre31 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: 10.4s, 165 PlacesBefore, 45 PlacesAfterwards, 155 TransitionsBefore, 34 TransitionsAfterwards, 3388 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 8731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4031, independent: 3796, independent conditional: 0, independent unconditional: 3796, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2406, independent: 2357, independent conditional: 0, independent unconditional: 2357, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2406, independent: 2315, independent conditional: 0, independent unconditional: 2315, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 511, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 423, dependent conditional: 0, dependent unconditional: 423, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4031, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 2406, unknown conditional: 0, unknown unconditional: 2406] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2709={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2709={7:0}, t2710={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2709={7:0}, t2710={8:0}, t2711={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2709={7:0}, t2710={8:0}, t2711={9:0}, t2712={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L774] 1 x = 1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L786] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L789] 2 y = 1 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={7:0}, t2710={8:0}, t2711={9:0}, t2712={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 882]: 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: 880]: 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: 878]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 40 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2874occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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:12:52,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12565d2c-f1bb-42be-b9f5-5790c655da83/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