./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5 --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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 19:44:14,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:44:14,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-21 19:44:14,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:44:14,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:44:14,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:44:14,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:44:14,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:44:14,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:44:14,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:44:14,458 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 19:44:14,459 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 19:44:14,459 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 19:44:14,460 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-21 19:44:14,461 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 19:44:14,461 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 19:44:14,462 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-21 19:44:14,463 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-21 19:44:14,463 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 19:44:14,464 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-21 19:44:14,464 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-21 19:44:14,477 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-21 19:44:14,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:44:14,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:44:14,479 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:44:14,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:44:14,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:44:14,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:44:14,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:44:14,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:44:14,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:44:14,482 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:44:14,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:44:14,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:44:14,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:44:14,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:44:14,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:44:14,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:14,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:44:14,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:44:14,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:44:14,489 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-21 19:44:14,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:44:14,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:44:14,490 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:44:14,490 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 19:44:14,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:44:14,490 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_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/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_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2023-11-21 19:44:14,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:44:14,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:44:14,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:44:14,950 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:44:14,951 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:44:14,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 19:44:18,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:44:18,629 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:44:18,630 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 19:44:18,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/data/7498a7122/071306a15ebb4b8795878cce37f9fa5d/FLAG5169d5c90 [2023-11-21 19:44:18,687 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/data/7498a7122/071306a15ebb4b8795878cce37f9fa5d [2023-11-21 19:44:18,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:44:18,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:44:18,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:18,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:44:18,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:44:18,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:18" (1/1) ... [2023-11-21 19:44:18,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3f2bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:18, skipping insertion in model container [2023-11-21 19:44:18,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:18" (1/1) ... [2023-11-21 19:44:18,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:44:19,081 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_63c24885-82e9-4dea-8a70-5facca6262ec/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-21 19:44:19,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:19,375 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:44:19,397 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_63c24885-82e9-4dea-8a70-5facca6262ec/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-21 19:44:19,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:19,578 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:44:19,579 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:44:19,589 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:44:19,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19 WrapperNode [2023-11-21 19:44:19,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:19,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:19,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:44:19,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:44:19,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,693 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-21 19:44:19,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:19,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:44:19,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:44:19,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:44:19,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:44:19,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:44:19,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:44:19,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:44:19,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (1/1) ... [2023-11-21 19:44:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:44:19,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:44:19,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:44:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 19:44:19,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:44:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:44:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:44:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:44:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 19:44:19,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 19:44:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 19:44:19,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 19:44:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 19:44:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 19:44:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 19:44:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:44:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:44:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:44:19,919 WARN L212 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:44:20,171 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:44:20,174 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:44:20,588 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:44:21,012 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:44:21,013 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 19:44:21,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:21 BoogieIcfgContainer [2023-11-21 19:44:21,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:44:21,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:44:21,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:44:21,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:44:21,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:44:18" (1/3) ... [2023-11-21 19:44:21,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f94271e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:21, skipping insertion in model container [2023-11-21 19:44:21,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:19" (2/3) ... [2023-11-21 19:44:21,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f94271e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:21, skipping insertion in model container [2023-11-21 19:44:21,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:21" (3/3) ... [2023-11-21 19:44:21,032 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-21 19:44:21,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:44:21,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:44:21,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 19:44:21,058 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:44:21,139 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:44:21,188 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 42 transitions, 96 flow [2023-11-21 19:44:21,599 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5778 states, 5775 states have (on average 3.5352380952380953) internal successors, (20416), 5777 states have internal predecessors, (20416), 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-21 19:44:21,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 19:44:21,636 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;@b82e8eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:44:21,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-21 19:44:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 5778 states, 5775 states have (on average 3.5352380952380953) internal successors, (20416), 5777 states have internal predecessors, (20416), 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-21 19:44:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-21 19:44:21,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:21,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-21 19:44:21,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:21,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 11571006, now seen corresponding path program 1 times [2023-11-21 19:44:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650456129] [2023-11-21 19:44:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:22,342 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-21 19:44:22,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650456129] [2023-11-21 19:44:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650456129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:44:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010309518] [2023-11-21 19:44:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:22,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:22,424 INFO L87 Difference]: Start difference. First operand has 5778 states, 5775 states have (on average 3.5352380952380953) internal successors, (20416), 5777 states have internal predecessors, (20416), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 19:44:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:22,722 INFO L93 Difference]: Finished difference Result 4966 states and 17235 transitions. [2023-11-21 19:44:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-11-21 19:44:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:22,871 INFO L225 Difference]: With dead ends: 4966 [2023-11-21 19:44:22,872 INFO L226 Difference]: Without dead ends: 4678 [2023-11-21 19:44:22,874 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-21 19:44:22,879 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:22,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2023-11-21 19:44:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4678. [2023-11-21 19:44:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 4677 states have (on average 3.4840709856745775) internal successors, (16295), 4677 states have internal predecessors, (16295), 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-21 19:44:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 16295 transitions. [2023-11-21 19:44:23,311 INFO L78 Accepts]: Start accepts. Automaton has 4678 states and 16295 transitions. Word has length 4 [2023-11-21 19:44:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:23,312 INFO L495 AbstractCegarLoop]: Abstraction has 4678 states and 16295 transitions. [2023-11-21 19:44:23,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-21 19:44:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4678 states and 16295 transitions. [2023-11-21 19:44:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-21 19:44:23,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:23,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:44:23,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:23,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2005913312, now seen corresponding path program 1 times [2023-11-21 19:44:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619548000] [2023-11-21 19:44:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:23,862 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-21 19:44:23,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619548000] [2023-11-21 19:44:23,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619548000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:23,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:23,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:44:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161234413] [2023-11-21 19:44:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:44:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:44:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:44:23,869 INFO L87 Difference]: Start difference. First operand 4678 states and 16295 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-21 19:44:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:24,305 INFO L93 Difference]: Finished difference Result 4790 states and 16321 transitions. [2023-11-21 19:44:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:44:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-11-21 19:44:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:24,351 INFO L225 Difference]: With dead ends: 4790 [2023-11-21 19:44:24,351 INFO L226 Difference]: Without dead ends: 3782 [2023-11-21 19:44:24,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:44:24,359 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 88 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:24,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 116 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:44:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2023-11-21 19:44:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3782. [2023-11-21 19:44:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 3.425284316318434) internal successors, (12951), 3781 states have internal predecessors, (12951), 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-21 19:44:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 12951 transitions. [2023-11-21 19:44:24,630 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 12951 transitions. Word has length 14 [2023-11-21 19:44:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:24,631 INFO L495 AbstractCegarLoop]: Abstraction has 3782 states and 12951 transitions. [2023-11-21 19:44:24,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-21 19:44:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 12951 transitions. [2023-11-21 19:44:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 19:44:24,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:24,641 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-21 19:44:24,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:44:24,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:24,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2067111838, now seen corresponding path program 1 times [2023-11-21 19:44:24,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254403175] [2023-11-21 19:44:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:25,061 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-21 19:44:25,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254403175] [2023-11-21 19:44:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254403175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:44:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158442117] [2023-11-21 19:44:25,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:25,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:44:25,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:44:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:44:25,078 INFO L87 Difference]: Start difference. First operand 3782 states and 12951 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 19:44:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:25,545 INFO L93 Difference]: Finished difference Result 5422 states and 18043 transitions. [2023-11-21 19:44:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:44:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 19:44:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:25,646 INFO L225 Difference]: With dead ends: 5422 [2023-11-21 19:44:25,646 INFO L226 Difference]: Without dead ends: 4342 [2023-11-21 19:44:25,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-21 19:44:25,648 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 113 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:25,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 119 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:44:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2023-11-21 19:44:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3542. [2023-11-21 19:44:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3541 states have (on average 3.3702343970629767) internal successors, (11934), 3541 states have internal predecessors, (11934), 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-21 19:44:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11934 transitions. [2023-11-21 19:44:25,821 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11934 transitions. Word has length 18 [2023-11-21 19:44:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:25,821 INFO L495 AbstractCegarLoop]: Abstraction has 3542 states and 11934 transitions. [2023-11-21 19:44:25,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 19:44:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11934 transitions. [2023-11-21 19:44:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 19:44:25,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:25,832 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-21 19:44:25,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 19:44:25,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:25,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 819855624, now seen corresponding path program 1 times [2023-11-21 19:44:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850275840] [2023-11-21 19:44:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:26,057 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-21 19:44:26,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850275840] [2023-11-21 19:44:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850275840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:44:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847454029] [2023-11-21 19:44:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:26,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 19:44:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:26,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 19:44:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 19:44:26,061 INFO L87 Difference]: Start difference. First operand 3542 states and 11934 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-21 19:44:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:26,216 INFO L93 Difference]: Finished difference Result 3242 states and 10202 transitions. [2023-11-21 19:44:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 19:44:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-21 19:44:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:26,258 INFO L225 Difference]: With dead ends: 3242 [2023-11-21 19:44:26,258 INFO L226 Difference]: Without dead ends: 2702 [2023-11-21 19:44:26,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-21 19:44:26,261 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:26,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2023-11-21 19:44:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2702. [2023-11-21 19:44:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 3.178822658274713) internal successors, (8586), 2701 states have internal predecessors, (8586), 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-21 19:44:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8586 transitions. [2023-11-21 19:44:26,427 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8586 transitions. Word has length 21 [2023-11-21 19:44:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:26,428 INFO L495 AbstractCegarLoop]: Abstraction has 2702 states and 8586 transitions. [2023-11-21 19:44:26,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-21 19:44:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8586 transitions. [2023-11-21 19:44:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 19:44:26,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:26,441 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] [2023-11-21 19:44:26,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 19:44:26,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:26,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1784803376, now seen corresponding path program 1 times [2023-11-21 19:44:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577173638] [2023-11-21 19:44:26,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:26,760 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-21 19:44:26,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577173638] [2023-11-21 19:44:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577173638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:44:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939800943] [2023-11-21 19:44:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:26,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:44:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:44:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:44:26,765 INFO L87 Difference]: Start difference. First operand 2702 states and 8586 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-21 19:44:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:26,982 INFO L93 Difference]: Finished difference Result 2014 states and 6054 transitions. [2023-11-21 19:44:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:44:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-11-21 19:44:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:26,993 INFO L225 Difference]: With dead ends: 2014 [2023-11-21 19:44:26,993 INFO L226 Difference]: Without dead ends: 1694 [2023-11-21 19:44:26,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-21 19:44:26,995 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 113 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:26,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 52 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2023-11-21 19:44:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1686. [2023-11-21 19:44:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 3.000593471810089) internal successors, (5056), 1685 states have internal predecessors, (5056), 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-21 19:44:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 5056 transitions. [2023-11-21 19:44:27,084 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 5056 transitions. Word has length 24 [2023-11-21 19:44:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:27,085 INFO L495 AbstractCegarLoop]: Abstraction has 1686 states and 5056 transitions. [2023-11-21 19:44:27,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-21 19:44:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 5056 transitions. [2023-11-21 19:44:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-21 19:44:27,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:27,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:27,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 19:44:27,093 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:27,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1634866441, now seen corresponding path program 1 times [2023-11-21 19:44:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053757703] [2023-11-21 19:44:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:27,483 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-21 19:44:27,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:27,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053757703] [2023-11-21 19:44:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053757703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:27,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:44:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875262760] [2023-11-21 19:44:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:44:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:44:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:44:27,489 INFO L87 Difference]: Start difference. First operand 1686 states and 5056 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-21 19:44:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:27,666 INFO L93 Difference]: Finished difference Result 1358 states and 4068 transitions. [2023-11-21 19:44:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:27,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2023-11-21 19:44:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:27,672 INFO L225 Difference]: With dead ends: 1358 [2023-11-21 19:44:27,672 INFO L226 Difference]: Without dead ends: 1174 [2023-11-21 19:44:27,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:44:27,674 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 150 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:27,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 38 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-11-21 19:44:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1110. [2023-11-21 19:44:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 2.9972948602344456) internal successors, (3324), 1109 states have internal predecessors, (3324), 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-21 19:44:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3324 transitions. [2023-11-21 19:44:27,720 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3324 transitions. Word has length 27 [2023-11-21 19:44:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:27,720 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 3324 transitions. [2023-11-21 19:44:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-21 19:44:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3324 transitions. [2023-11-21 19:44:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:27,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:27,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:27,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 19:44:27,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:27,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash -649015839, now seen corresponding path program 1 times [2023-11-21 19:44:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880374896] [2023-11-21 19:44:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:28,159 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-21 19:44:28,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880374896] [2023-11-21 19:44:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880374896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:44:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918844836] [2023-11-21 19:44:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:28,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:44:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:44:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:44:28,162 INFO L87 Difference]: Start difference. First operand 1110 states and 3324 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-21 19:44:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:28,367 INFO L93 Difference]: Finished difference Result 1654 states and 4906 transitions. [2023-11-21 19:44:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 32 [2023-11-21 19:44:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:28,371 INFO L225 Difference]: With dead ends: 1654 [2023-11-21 19:44:28,371 INFO L226 Difference]: Without dead ends: 828 [2023-11-21 19:44:28,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:44:28,375 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:28,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 92 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2023-11-21 19:44:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2023-11-21 19:44:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 2.902055622732769) internal successors, (2400), 827 states have internal predecessors, (2400), 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-21 19:44:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2400 transitions. [2023-11-21 19:44:28,407 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2400 transitions. Word has length 32 [2023-11-21 19:44:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:28,409 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 2400 transitions. [2023-11-21 19:44:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-21 19:44:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2400 transitions. [2023-11-21 19:44:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:28,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:28,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:28,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 19:44:28,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:28,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1341544701, now seen corresponding path program 2 times [2023-11-21 19:44:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339204509] [2023-11-21 19:44:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:28,818 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-21 19:44:28,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339204509] [2023-11-21 19:44:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339204509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:44:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591927525] [2023-11-21 19:44:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:44:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:44:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:44:28,821 INFO L87 Difference]: Start difference. First operand 828 states and 2400 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-21 19:44:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:29,110 INFO L93 Difference]: Finished difference Result 1140 states and 3288 transitions. [2023-11-21 19:44:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:44:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 32 [2023-11-21 19:44:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:29,114 INFO L225 Difference]: With dead ends: 1140 [2023-11-21 19:44:29,114 INFO L226 Difference]: Without dead ends: 700 [2023-11-21 19:44:29,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:44:29,115 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:29,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 94 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2023-11-21 19:44:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 620. [2023-11-21 19:44:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.8045234248788367) internal successors, (1736), 619 states have internal predecessors, (1736), 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-21 19:44:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1736 transitions. [2023-11-21 19:44:29,140 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1736 transitions. Word has length 32 [2023-11-21 19:44:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1736 transitions. [2023-11-21 19:44:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-21 19:44:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1736 transitions. [2023-11-21 19:44:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:29,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:29,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:29,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 19:44:29,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:29,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1993490297, now seen corresponding path program 3 times [2023-11-21 19:44:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420883237] [2023-11-21 19:44:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:29,968 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-21 19:44:29,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420883237] [2023-11-21 19:44:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420883237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 19:44:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230510661] [2023-11-21 19:44:29,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:29,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:44:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:44:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:44:29,972 INFO L87 Difference]: Start difference. First operand 620 states and 1736 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-21 19:44:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:30,539 INFO L93 Difference]: Finished difference Result 904 states and 2520 transitions. [2023-11-21 19:44:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 19:44:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2023-11-21 19:44:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:30,543 INFO L225 Difference]: With dead ends: 904 [2023-11-21 19:44:30,543 INFO L226 Difference]: Without dead ends: 516 [2023-11-21 19:44:30,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-11-21 19:44:30,544 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:30,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 182 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:44:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-11-21 19:44:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2023-11-21 19:44:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 2.7262135922330097) internal successors, (1404), 515 states have internal predecessors, (1404), 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-21 19:44:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1404 transitions. [2023-11-21 19:44:30,569 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1404 transitions. Word has length 32 [2023-11-21 19:44:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:30,570 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 1404 transitions. [2023-11-21 19:44:30,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-21 19:44:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1404 transitions. [2023-11-21 19:44:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:30,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:30,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:30,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 19:44:30,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:30,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1670726871, now seen corresponding path program 4 times [2023-11-21 19:44:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375714705] [2023-11-21 19:44:30,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:32,152 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-21 19:44:32,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375714705] [2023-11-21 19:44:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375714705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:32,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:32,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 19:44:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389924101] [2023-11-21 19:44:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:44:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:44:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:44:32,155 INFO L87 Difference]: Start difference. First operand 516 states and 1404 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 19:44:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:32,533 INFO L93 Difference]: Finished difference Result 830 states and 2240 transitions. [2023-11-21 19:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 19:44:32,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2023-11-21 19:44:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:32,536 INFO L225 Difference]: With dead ends: 830 [2023-11-21 19:44:32,536 INFO L226 Difference]: Without dead ends: 478 [2023-11-21 19:44:32,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-21 19:44:32,537 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:32,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:44:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-21 19:44:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2023-11-21 19:44:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.622107969151671) internal successors, (1020), 389 states have internal predecessors, (1020), 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-21 19:44:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1020 transitions. [2023-11-21 19:44:32,552 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1020 transitions. Word has length 32 [2023-11-21 19:44:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:32,553 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 1020 transitions. [2023-11-21 19:44:32,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 19:44:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1020 transitions. [2023-11-21 19:44:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:32,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:32,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:32,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:44:32,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:32,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1121555321, now seen corresponding path program 5 times [2023-11-21 19:44:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436151201] [2023-11-21 19:44:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:32,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:33,379 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-21 19:44:33,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:44:33,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436151201] [2023-11-21 19:44:33,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436151201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:33,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 19:44:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108251811] [2023-11-21 19:44:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:33,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:44:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:44:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:44:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:44:33,385 INFO L87 Difference]: Start difference. First operand 390 states and 1020 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 19:44:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:33,785 INFO L93 Difference]: Finished difference Result 590 states and 1540 transitions. [2023-11-21 19:44:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 19:44:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2023-11-21 19:44:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:33,787 INFO L225 Difference]: With dead ends: 590 [2023-11-21 19:44:33,787 INFO L226 Difference]: Without dead ends: 388 [2023-11-21 19:44:33,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-21 19:44:33,789 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:33,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 148 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:44:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-21 19:44:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 300. [2023-11-21 19:44:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.488294314381271) internal successors, (744), 299 states have internal predecessors, (744), 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-21 19:44:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 744 transitions. [2023-11-21 19:44:33,801 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 744 transitions. Word has length 32 [2023-11-21 19:44:33,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:33,801 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 744 transitions. [2023-11-21 19:44:33,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-21 19:44:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 744 transitions. [2023-11-21 19:44:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-21 19:44:33,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:33,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:33,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:44:33,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-21 19:44:33,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1820091655, now seen corresponding path program 6 times [2023-11-21 19:44:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:44:33,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848809041] [2023-11-21 19:44:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:44:33,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:44:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:44:34,022 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-21 19:44:34,023 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:44:34,024 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-21 19:44:34,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-21 19:44:34,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-21 19:44:34,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-21 19:44:34,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-21 19:44:34,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-21 19:44:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:44:34,032 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:34,039 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 19:44:34,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 19:44:34,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 19:44:34,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 19:44:34,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 19:44:34,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 07:44:34 BasicIcfg [2023-11-21 19:44:34,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 19:44:34,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 19:44:34,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 19:44:34,188 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 19:44:34,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:21" (3/4) ... [2023-11-21 19:44:34,189 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 19:44:34,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 19:44:34,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 19:44:34,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 19:44:34,347 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/witness.graphml [2023-11-21 19:44:34,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 19:44:34,349 INFO L158 Benchmark]: Toolchain (without parser) took 15650.90ms. Allocated memory was 134.2MB in the beginning and 469.8MB in the end (delta: 335.5MB). Free memory was 91.6MB in the beginning and 211.1MB in the end (delta: -119.4MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,349 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:44:34,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 888.69ms. Allocated memory is still 134.2MB. Free memory was 91.6MB in the beginning and 84.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.41ms. Allocated memory is still 134.2MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,350 INFO L158 Benchmark]: Boogie Preprocessor took 112.10ms. Allocated memory is still 134.2MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,351 INFO L158 Benchmark]: RCFGBuilder took 1208.78ms. Allocated memory is still 134.2MB. Free memory was 79.5MB in the beginning and 98.2MB in the end (delta: -18.7MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,352 INFO L158 Benchmark]: TraceAbstraction took 13165.96ms. Allocated memory was 134.2MB in the beginning and 469.8MB in the end (delta: 335.5MB). Free memory was 97.5MB in the beginning and 224.7MB in the end (delta: -127.2MB). Peak memory consumption was 208.0MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,352 INFO L158 Benchmark]: Witness Printer took 160.70ms. Allocated memory is still 469.8MB. Free memory was 224.7MB in the beginning and 211.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 19:44:34,356 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 107.0MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 888.69ms. Allocated memory is still 134.2MB. Free memory was 91.6MB in the beginning and 84.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.41ms. Allocated memory is still 134.2MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.10ms. Allocated memory is still 134.2MB. Free memory was 81.8MB in the beginning and 79.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1208.78ms. Allocated memory is still 134.2MB. Free memory was 79.5MB in the beginning and 98.2MB in the end (delta: -18.7MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13165.96ms. Allocated memory was 134.2MB in the beginning and 469.8MB in the end (delta: 335.5MB). Free memory was 97.5MB in the beginning and 224.7MB in the end (delta: -127.2MB). Peak memory consumption was 208.0MB. Max. memory is 16.1GB. * Witness Printer took 160.70ms. Allocated memory is still 469.8MB. Free memory was 224.7MB in the beginning and 211.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - 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: 849]: 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: 853]: 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: 851]: 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 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 915 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1612 IncrementalHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 272 mSDtfsCounter, 1612 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5778occurred in iteration=0, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1128 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 2145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-21 19:44:34,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63c24885-82e9-4dea-8a70-5facca6262ec/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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