./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh --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 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:32:37,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:32:37,556 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:32:37,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:32:37,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:32:37,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:32:37,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:32:37,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:32:37,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:32:37,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:32:37,591 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:32:37,591 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:32:37,592 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:32:37,592 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:32:37,593 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:32:37,593 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:32:37,594 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:32:37,594 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:32:37,595 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:32:37,595 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:32:37,596 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:32:37,597 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:32:37,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:32:37,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:32:37,599 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:32:37,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:32:37,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:32:37,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:32:37,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:32:37,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:32:37,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:32:37,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:32:37,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:32:37,602 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:32:37,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:32:37,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:32:37,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:32:37,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:32:37,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:32:37,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:32:37,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:32:37,604 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:32:37,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:32:37,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:32:37,605 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:32:37,605 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:32:37,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:32:37,605 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_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/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_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2023-12-02 08:32:37,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:32:37,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:32:37,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:32:37,857 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:32:37,857 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:32:37,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 08:32:40,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:32:41,001 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:32:41,001 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 08:32:41,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/data/db8c90089/99172002697048fab5d8031951373f1a/FLAG5b2be0a9d [2023-12-02 08:32:41,032 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/data/db8c90089/99172002697048fab5d8031951373f1a [2023-12-02 08:32:41,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:32:41,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:32:41,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:32:41,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:32:41,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:32:41,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a51ecd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41, skipping insertion in model container [2023-12-02 08:32:41,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,093 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:32:41,241 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_ab5909ae-43d3-4661-b603-93014a97c1c4/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-12-02 08:32:41,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:32:41,433 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:32:41,444 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_ab5909ae-43d3-4661-b603-93014a97c1c4/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-12-02 08:32:41,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:32:41,531 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 08:32:41,531 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 08:32:41,537 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:32:41,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41 WrapperNode [2023-12-02 08:32:41,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:32:41,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:32:41,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:32:41,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:32:41,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,592 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-12-02 08:32:41,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:32:41,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:32:41,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:32:41,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:32:41,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:32:41,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:32:41,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:32:41,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:32:41,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (1/1) ... [2023-12-02 08:32:41,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:32:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:41,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:32:41,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:32:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:32:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 08:32:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:32:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:32:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:32:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 08:32:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 08:32:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 08:32:41,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 08:32:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 08:32:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 08:32:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:32:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 08:32:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:32:41,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:32:41,707 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 08:32:41,856 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:32:41,859 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:32:42,177 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:32:42,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:32:42,377 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 08:32:42,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42 BoogieIcfgContainer [2023-12-02 08:32:42,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:32:42,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:32:42,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:32:42,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:32:42,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:32:41" (1/3) ... [2023-12-02 08:32:42,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629da0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:42, skipping insertion in model container [2023-12-02 08:32:42,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:41" (2/3) ... [2023-12-02 08:32:42,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629da0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:42, skipping insertion in model container [2023-12-02 08:32:42,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42" (3/3) ... [2023-12-02 08:32:42,388 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-12-02 08:32:42,397 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 08:32:42,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:32:42,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 08:32:42,409 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 08:32:42,462 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 08:32:42,496 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 40 transitions, 92 flow [2023-12-02 08:32:42,753 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4514 states, 4511 states have (on average 3.500332520505431) internal successors, (15790), 4513 states have internal predecessors, (15790), 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-12-02 08:32:42,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:32:42,782 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;@1bb3875e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:32:42,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 08:32:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 4514 states, 4511 states have (on average 3.500332520505431) internal successors, (15790), 4513 states have internal predecessors, (15790), 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-12-02 08:32:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:32:42,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:42,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:32:42,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:42,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1967837457, now seen corresponding path program 1 times [2023-12-02 08:32:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823965319] [2023-12-02 08:32:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:43,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823965319] [2023-12-02 08:32:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823965319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:43,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:32:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450872842] [2023-12-02 08:32:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:43,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:32:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:32:43,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:32:43,291 INFO L87 Difference]: Start difference. First operand has 4514 states, 4511 states have (on average 3.500332520505431) internal successors, (15790), 4513 states have internal predecessors, (15790), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-02 08:32:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:43,467 INFO L93 Difference]: Finished difference Result 3882 states and 13333 transitions. [2023-12-02 08:32:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:32:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-02 08:32:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:43,530 INFO L225 Difference]: With dead ends: 3882 [2023-12-02 08:32:43,530 INFO L226 Difference]: Without dead ends: 3658 [2023-12-02 08:32:43,532 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-12-02 08:32:43,536 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:43,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2023-12-02 08:32:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3658. [2023-12-02 08:32:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 3657 states have (on average 3.447908121410993) internal successors, (12609), 3657 states have internal predecessors, (12609), 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-12-02 08:32:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 12609 transitions. [2023-12-02 08:32:43,799 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 12609 transitions. Word has length 6 [2023-12-02 08:32:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:43,800 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 12609 transitions. [2023-12-02 08:32:43,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-02 08:32:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 12609 transitions. [2023-12-02 08:32:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 08:32:43,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:43,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:43,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:32:43,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:43,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1481936323, now seen corresponding path program 1 times [2023-12-02 08:32:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581136393] [2023-12-02 08:32:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:44,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581136393] [2023-12-02 08:32:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581136393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:32:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681455799] [2023-12-02 08:32:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:44,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:32:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:32:44,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:32:44,090 INFO L87 Difference]: Start difference. First operand 3658 states and 12609 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-12-02 08:32:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:44,505 INFO L93 Difference]: Finished difference Result 6936 states and 23236 transitions. [2023-12-02 08:32:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:32:44,506 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-12-02 08:32:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:44,546 INFO L225 Difference]: With dead ends: 6936 [2023-12-02 08:32:44,547 INFO L226 Difference]: Without dead ends: 4744 [2023-12-02 08:32:44,547 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-12-02 08:32:44,549 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 83 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:44,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 115 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:32:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2023-12-02 08:32:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3712. [2023-12-02 08:32:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3711 states have (on average 3.304500134734573) internal successors, (12263), 3711 states have internal predecessors, (12263), 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-12-02 08:32:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 12263 transitions. [2023-12-02 08:32:44,714 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 12263 transitions. Word has length 14 [2023-12-02 08:32:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:44,715 INFO L495 AbstractCegarLoop]: Abstraction has 3712 states and 12263 transitions. [2023-12-02 08:32:44,716 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-12-02 08:32:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 12263 transitions. [2023-12-02 08:32:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 08:32:44,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:44,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:44,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:32:44,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:44,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1532145026, now seen corresponding path program 1 times [2023-12-02 08:32:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:44,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147387842] [2023-12-02 08:32:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:44,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147387842] [2023-12-02 08:32:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147387842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:32:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232869612] [2023-12-02 08:32:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:44,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:32:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:32:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:32:44,959 INFO L87 Difference]: Start difference. First operand 3712 states and 12263 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-12-02 08:32:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:45,356 INFO L93 Difference]: Finished difference Result 5012 states and 16177 transitions. [2023-12-02 08:32:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:32:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-12-02 08:32:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:45,394 INFO L225 Difference]: With dead ends: 5012 [2023-12-02 08:32:45,395 INFO L226 Difference]: Without dead ends: 3800 [2023-12-02 08:32:45,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 08:32:45,396 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 128 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:45,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 120 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:32:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2023-12-02 08:32:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 2936. [2023-12-02 08:32:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 3.2991482112436117) internal successors, (9683), 2935 states have internal predecessors, (9683), 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-12-02 08:32:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 9683 transitions. [2023-12-02 08:32:45,533 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 9683 transitions. Word has length 16 [2023-12-02 08:32:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:45,534 INFO L495 AbstractCegarLoop]: Abstraction has 2936 states and 9683 transitions. [2023-12-02 08:32:45,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-12-02 08:32:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 9683 transitions. [2023-12-02 08:32:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 08:32:45,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:45,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:32:45,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:45,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -714082271, now seen corresponding path program 1 times [2023-12-02 08:32:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984676703] [2023-12-02 08:32:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:45,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984676703] [2023-12-02 08:32:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984676703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:45,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:32:45,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467255417] [2023-12-02 08:32:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:45,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:32:45,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:45,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:32:45,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:32:45,811 INFO L87 Difference]: Start difference. First operand 2936 states and 9683 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-02 08:32:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:46,142 INFO L93 Difference]: Finished difference Result 5296 states and 17150 transitions. [2023-12-02 08:32:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:32:46,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-02 08:32:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:46,175 INFO L225 Difference]: With dead ends: 5296 [2023-12-02 08:32:46,175 INFO L226 Difference]: Without dead ends: 3156 [2023-12-02 08:32:46,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:32:46,177 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 105 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 126 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:32:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2023-12-02 08:32:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2516. [2023-12-02 08:32:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2515 states have (on average 3.2274353876739563) internal successors, (8117), 2515 states have internal predecessors, (8117), 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-12-02 08:32:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 8117 transitions. [2023-12-02 08:32:46,285 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 8117 transitions. Word has length 18 [2023-12-02 08:32:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:46,286 INFO L495 AbstractCegarLoop]: Abstraction has 2516 states and 8117 transitions. [2023-12-02 08:32:46,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-12-02 08:32:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 8117 transitions. [2023-12-02 08:32:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 08:32:46,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:46,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:46,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:32:46,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:46,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2057979230, now seen corresponding path program 1 times [2023-12-02 08:32:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678365932] [2023-12-02 08:32:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:46,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678365932] [2023-12-02 08:32:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678365932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:32:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914132857] [2023-12-02 08:32:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:32:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:32:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:32:46,510 INFO L87 Difference]: Start difference. First operand 2516 states and 8117 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:32:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:46,928 INFO L93 Difference]: Finished difference Result 5532 states and 17383 transitions. [2023-12-02 08:32:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:32:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 08:32:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:46,941 INFO L225 Difference]: With dead ends: 5532 [2023-12-02 08:32:46,942 INFO L226 Difference]: Without dead ends: 3346 [2023-12-02 08:32:46,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-02 08:32:46,943 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 135 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:46,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 171 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:32:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2023-12-02 08:32:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 1826. [2023-12-02 08:32:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 3.1791780821917808) internal successors, (5802), 1825 states have internal predecessors, (5802), 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-12-02 08:32:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 5802 transitions. [2023-12-02 08:32:47,045 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 5802 transitions. Word has length 20 [2023-12-02 08:32:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:47,045 INFO L495 AbstractCegarLoop]: Abstraction has 1826 states and 5802 transitions. [2023-12-02 08:32:47,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:32:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 5802 transitions. [2023-12-02 08:32:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 08:32:47,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:47,050 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-12-02 08:32:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:32:47,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:47,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1145232299, now seen corresponding path program 1 times [2023-12-02 08:32:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067570134] [2023-12-02 08:32:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:47,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067570134] [2023-12-02 08:32:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067570134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:32:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977758761] [2023-12-02 08:32:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:47,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:32:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:32:47,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:32:47,257 INFO L87 Difference]: Start difference. First operand 1826 states and 5802 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12-02 08:32:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:47,518 INFO L93 Difference]: Finished difference Result 2098 states and 6526 transitions. [2023-12-02 08:32:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:32:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12-02 08:32:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:47,524 INFO L225 Difference]: With dead ends: 2098 [2023-12-02 08:32:47,524 INFO L226 Difference]: Without dead ends: 1650 [2023-12-02 08:32:47,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 08:32:47,526 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 88 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 98 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-12-02 08:32:47,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 98 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:32:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2023-12-02 08:32:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1610. [2023-12-02 08:32:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 3.1771286513362336) internal successors, (5112), 1609 states have internal predecessors, (5112), 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-12-02 08:32:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5112 transitions. [2023-12-02 08:32:47,567 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5112 transitions. Word has length 21 [2023-12-02 08:32:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:47,568 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 5112 transitions. [2023-12-02 08:32:47,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12-02 08:32:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5112 transitions. [2023-12-02 08:32:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 08:32:47,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:47,571 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] [2023-12-02 08:32:47,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:32:47,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:47,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1601926627, now seen corresponding path program 1 times [2023-12-02 08:32:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222028080] [2023-12-02 08:32:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:47,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222028080] [2023-12-02 08:32:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222028080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:32:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198955749] [2023-12-02 08:32:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:32:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:32:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:32:47,702 INFO L87 Difference]: Start difference. First operand 1610 states and 5112 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-12-02 08:32:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:47,788 INFO L93 Difference]: Finished difference Result 1538 states and 4610 transitions. [2023-12-02 08:32:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:32:47,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-02 08:32:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:47,793 INFO L225 Difference]: With dead ends: 1538 [2023-12-02 08:32:47,793 INFO L226 Difference]: Without dead ends: 1306 [2023-12-02 08:32:47,794 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-12-02 08:32:47,795 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:47,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 35 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2023-12-02 08:32:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2023-12-02 08:32:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 3.049808429118774) internal successors, (3980), 1305 states have internal predecessors, (3980), 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-12-02 08:32:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 3980 transitions. [2023-12-02 08:32:47,846 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 3980 transitions. Word has length 22 [2023-12-02 08:32:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:47,846 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 3980 transitions. [2023-12-02 08:32:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-12-02 08:32:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 3980 transitions. [2023-12-02 08:32:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:32:47,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:47,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 08:32:47,851 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:47,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash -59117084, now seen corresponding path program 1 times [2023-12-02 08:32:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995724886] [2023-12-02 08:32:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:48,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995724886] [2023-12-02 08:32:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995724886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:32:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387624385] [2023-12-02 08:32:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:32:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:32:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:32:48,028 INFO L87 Difference]: Start difference. First operand 1306 states and 3980 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-12-02 08:32:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:48,150 INFO L93 Difference]: Finished difference Result 1010 states and 2876 transitions. [2023-12-02 08:32:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:32:48,151 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-12-02 08:32:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:48,154 INFO L225 Difference]: With dead ends: 1010 [2023-12-02 08:32:48,154 INFO L226 Difference]: Without dead ends: 858 [2023-12-02 08:32:48,155 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-12-02 08:32:48,155 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:48,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 39 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-12-02 08:32:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2023-12-02 08:32:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.849474912485414) internal successors, (2442), 857 states have internal predecessors, (2442), 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-12-02 08:32:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2442 transitions. [2023-12-02 08:32:48,183 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2442 transitions. Word has length 24 [2023-12-02 08:32:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:48,184 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 2442 transitions. [2023-12-02 08:32:48,184 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-12-02 08:32:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2442 transitions. [2023-12-02 08:32:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 08:32:48,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:48,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 08:32:48,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:48,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1899424463, now seen corresponding path program 1 times [2023-12-02 08:32:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328129208] [2023-12-02 08:32:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:48,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328129208] [2023-12-02 08:32:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328129208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:32:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81453953] [2023-12-02 08:32:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:48,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:32:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:48,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:32:48,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:32:48,389 INFO L87 Difference]: Start difference. First operand 858 states and 2442 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 08:32:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:48,512 INFO L93 Difference]: Finished difference Result 642 states and 1782 transitions. [2023-12-02 08:32:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:32:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2023-12-02 08:32:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:48,515 INFO L225 Difference]: With dead ends: 642 [2023-12-02 08:32:48,515 INFO L226 Difference]: Without dead ends: 586 [2023-12-02 08:32:48,515 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-12-02 08:32:48,516 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:48,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 29 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-02 08:32:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 522. [2023-12-02 08:32:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 2.7523992322456814) internal successors, (1434), 521 states have internal predecessors, (1434), 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-12-02 08:32:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1434 transitions. [2023-12-02 08:32:48,531 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1434 transitions. Word has length 26 [2023-12-02 08:32:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:48,531 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1434 transitions. [2023-12-02 08:32:48,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 08:32:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1434 transitions. [2023-12-02 08:32:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:32:48,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:48,534 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] [2023-12-02 08:32:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 08:32:48,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:48,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -493451379, now seen corresponding path program 1 times [2023-12-02 08:32:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862554028] [2023-12-02 08:32:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:48,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862554028] [2023-12-02 08:32:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862554028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:32:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899267476] [2023-12-02 08:32:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:48,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:32:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:32:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:32:48,774 INFO L87 Difference]: Start difference. First operand 522 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-12-02 08:32:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:48,896 INFO L93 Difference]: Finished difference Result 770 states and 2122 transitions. [2023-12-02 08:32:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:32:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2023-12-02 08:32:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:48,899 INFO L225 Difference]: With dead ends: 770 [2023-12-02 08:32:48,899 INFO L226 Difference]: Without dead ends: 434 [2023-12-02 08:32:48,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:32:48,900 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:48,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:32:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-12-02 08:32:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2023-12-02 08:32:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.7575057736720554) internal successors, (1194), 433 states have internal predecessors, (1194), 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-12-02 08:32:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1194 transitions. [2023-12-02 08:32:48,913 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1194 transitions. Word has length 30 [2023-12-02 08:32:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:48,914 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1194 transitions. [2023-12-02 08:32:48,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-12-02 08:32:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1194 transitions. [2023-12-02 08:32:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:32:48,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:48,916 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] [2023-12-02 08:32:48,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 08:32:48,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:48,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1878633043, now seen corresponding path program 2 times [2023-12-02 08:32:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926585782] [2023-12-02 08:32:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:49,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926585782] [2023-12-02 08:32:49,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926585782] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:49,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:32:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393855423] [2023-12-02 08:32:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:49,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:32:49,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:32:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:32:49,900 INFO L87 Difference]: Start difference. First operand 434 states and 1194 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-12-02 08:32:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:50,212 INFO L93 Difference]: Finished difference Result 770 states and 2080 transitions. [2023-12-02 08:32:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:32:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2023-12-02 08:32:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:50,214 INFO L225 Difference]: With dead ends: 770 [2023-12-02 08:32:50,214 INFO L226 Difference]: Without dead ends: 478 [2023-12-02 08:32:50,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-02 08:32:50,215 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 96 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:50,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 171 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:32:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-02 08:32:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 350. [2023-12-02 08:32:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.664756446991404) internal successors, (930), 349 states have internal predecessors, (930), 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-12-02 08:32:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 930 transitions. [2023-12-02 08:32:50,228 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 930 transitions. Word has length 30 [2023-12-02 08:32:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:50,228 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 930 transitions. [2023-12-02 08:32:50,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-12-02 08:32:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 930 transitions. [2023-12-02 08:32:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:32:50,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:50,230 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] [2023-12-02 08:32:50,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 08:32:50,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:50,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1741884877, now seen corresponding path program 3 times [2023-12-02 08:32:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:50,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875310333] [2023-12-02 08:32:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:51,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:51,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875310333] [2023-12-02 08:32:51,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875310333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:32:51,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:32:51,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:32:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234745275] [2023-12-02 08:32:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:32:51,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:32:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:32:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:32:51,143 INFO L87 Difference]: Start difference. First operand 350 states and 930 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-12-02 08:32:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:51,523 INFO L93 Difference]: Finished difference Result 514 states and 1366 transitions. [2023-12-02 08:32:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:32:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2023-12-02 08:32:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:51,525 INFO L225 Difference]: With dead ends: 514 [2023-12-02 08:32:51,525 INFO L226 Difference]: Without dead ends: 294 [2023-12-02 08:32:51,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-02 08:32:51,526 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:51,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 146 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:32:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-02 08:32:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 278. [2023-12-02 08:32:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.5342960288808665) internal successors, (702), 277 states have internal predecessors, (702), 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-12-02 08:32:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 702 transitions. [2023-12-02 08:32:51,533 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 702 transitions. Word has length 30 [2023-12-02 08:32:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:51,534 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 702 transitions. [2023-12-02 08:32:51,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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-12-02 08:32:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 702 transitions. [2023-12-02 08:32:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:32:51,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:51,535 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] [2023-12-02 08:32:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 08:32:51,535 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 08:32:51,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1709254037, now seen corresponding path program 4 times [2023-12-02 08:32:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848348940] [2023-12-02 08:32:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:32:51,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 08:32:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:32:51,656 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 08:32:51,657 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 08:32:51,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-02 08:32:51,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-02 08:32:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-12-02 08:32:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-12-02 08:32:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-12-02 08:32:51,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-02 08:32:51,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 08:32:51,664 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:51,669 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 08:32:51,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 08:32:51,724 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 08:32:51,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 08:32:51,729 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 08:32:51,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:32:51 BasicIcfg [2023-12-02 08:32:51,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 08:32:51,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 08:32:51,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 08:32:51,749 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 08:32:51,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:42" (3/4) ... [2023-12-02 08:32:51,750 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 08:32:51,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 08:32:51,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 08:32:51,776 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 08:32:51,859 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 08:32:51,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 08:32:51,860 INFO L158 Benchmark]: Toolchain (without parser) took 10823.19ms. Allocated memory was 155.2MB in the beginning and 297.8MB in the end (delta: 142.6MB). Free memory was 114.0MB in the beginning and 189.1MB in the end (delta: -75.1MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,860 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:32:51,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.34ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 90.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.17ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 88.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,861 INFO L158 Benchmark]: Boogie Preprocessor took 35.78ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,861 INFO L158 Benchmark]: RCFGBuilder took 747.80ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 86.0MB in the beginning and 138.8MB in the end (delta: -52.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,862 INFO L158 Benchmark]: TraceAbstraction took 9367.04ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 137.8MB in the beginning and 201.7MB in the end (delta: -63.8MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,862 INFO L158 Benchmark]: Witness Printer took 110.23ms. Allocated memory is still 297.8MB. Free memory was 201.7MB in the beginning and 189.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 08:32:51,864 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.18ms. Allocated memory is still 155.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.34ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 90.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.17ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 88.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.78ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 747.80ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 86.0MB in the beginning and 138.8MB in the end (delta: -52.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9367.04ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 137.8MB in the beginning and 201.7MB in the end (delta: -63.8MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 110.23ms. Allocated memory is still 297.8MB. Free memory was 201.7MB in the beginning and 189.1MB in the end (delta: 12.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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 836]: 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: 834]: 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: 832]: 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, 66 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 1143 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 841 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 302 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4514occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 4304 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12-02 08:32:51,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab5909ae-43d3-4661-b603-93014a97c1c4/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE