./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire --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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:35:27,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:35:28,072 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 20:35:28,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:35:28,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:35:28,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:35:28,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:35:28,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:35:28,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:35:28,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:35:28,133 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:35:28,135 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:35:28,135 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:35:28,137 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:35:28,137 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:35:28,138 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:35:28,138 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:35:28,139 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:35:28,139 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:35:28,141 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:35:28,141 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:35:28,142 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:35:28,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:35:28,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:35:28,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:35:28,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:35:28,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:35:28,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:35:28,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:35:28,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:35:28,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:35:28,162 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:35:28,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:35:28,163 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:35:28,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:35:28,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:35:28,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:35:28,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:28,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:35:28,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:35:28,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:35:28,166 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:35:28,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:35:28,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:35:28,167 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:35:28,167 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:35:28,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:35:28,167 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_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/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_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-23 20:35:28,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:35:28,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:35:28,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:35:28,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:35:28,525 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:35:28,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-23 20:35:31,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:35:31,925 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:35:31,926 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-23 20:35:31,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/data/236282b29/b666d0ab8ef241ca9603987a46728671/FLAG164835953 [2023-11-23 20:35:31,969 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/data/236282b29/b666d0ab8ef241ca9603987a46728671 [2023-11-23 20:35:31,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:35:31,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:35:31,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:31,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:35:31,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:35:31,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:31" (1/1) ... [2023-11-23 20:35:31,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edb2e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:31, skipping insertion in model container [2023-11-23 20:35:31,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:31" (1/1) ... [2023-11-23 20:35:32,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:35:32,232 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_52c50d22-c7f8-4f46-b275-fa8f2c329776/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-23 20:35:32,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:32,540 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:35:32,553 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_52c50d22-c7f8-4f46-b275-fa8f2c329776/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-11-23 20:35:32,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:32,645 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:35:32,646 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:35:32,655 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:35:32,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32 WrapperNode [2023-11-23 20:35:32,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:32,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:32,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:35:32,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:35:32,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,752 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-11-23 20:35:32,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:32,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:35:32,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:35:32,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:35:32,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:35:32,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:35:32,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:35:32,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:35:32,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (1/1) ... [2023-11-23 20:35:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:32,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:35:32,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:35:32,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:35:32,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 20:35:32,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:35:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:35:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:35:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 20:35:32,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 20:35:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 20:35:32,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 20:35:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 20:35:32,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 20:35:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:35:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 20:35:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:35:32,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:35:32,917 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 20:35:33,071 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:35:33,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:35:33,547 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:35:33,727 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:35:33,727 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:35:33,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:33 BoogieIcfgContainer [2023-11-23 20:35:33,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:35:33,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:35:33,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:35:33,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:35:33,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:35:31" (1/3) ... [2023-11-23 20:35:33,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020d172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:33, skipping insertion in model container [2023-11-23 20:35:33,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:32" (2/3) ... [2023-11-23 20:35:33,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020d172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:33, skipping insertion in model container [2023-11-23 20:35:33,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:33" (3/3) ... [2023-11-23 20:35:33,738 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-23 20:35:33,747 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 20:35:33,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:35:33,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 20:35:33,757 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 20:35:33,831 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 20:35:33,862 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2023-11-23 20:35:34,129 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:34,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:35:34,158 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;@3c6babdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:35:34,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-23 20:35:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 20:35:34,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:34,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 20:35:34,186 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-11-23 20:35:34,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1966912943, now seen corresponding path program 1 times [2023-11-23 20:35:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194711461] [2023-11-23 20:35:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:34,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194711461] [2023-11-23 20:35:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194711461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:35:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557626113] [2023-11-23 20:35:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:34,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:34,853 INFO L87 Difference]: Start difference. First operand has 3950 states, 3947 states have (on average 3.4826450468710415) internal successors, (13746), 3949 states have internal predecessors, (13746), 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-11-23 20:35:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:35,030 INFO L93 Difference]: Finished difference Result 3397 states and 11606 transitions. [2023-11-23 20:35:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:35,033 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-11-23 20:35:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:35,085 INFO L225 Difference]: With dead ends: 3397 [2023-11-23 20:35:35,086 INFO L226 Difference]: Without dead ends: 3201 [2023-11-23 20:35:35,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:35,092 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 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-11-23 20:35:35,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2023-11-23 20:35:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2023-11-23 20:35:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 3.43) internal successors, (10976), 3200 states have internal predecessors, (10976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 10976 transitions. [2023-11-23 20:35:35,368 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 10976 transitions. Word has length 6 [2023-11-23 20:35:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:35,368 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 10976 transitions. [2023-11-23 20:35:35,369 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-11-23 20:35:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 10976 transitions. [2023-11-23 20:35:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:35:35,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:35,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:35,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:35:35,383 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-11-23 20:35:35,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2075608294, now seen corresponding path program 1 times [2023-11-23 20:35:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:35,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205815150] [2023-11-23 20:35:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:35,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205815150] [2023-11-23 20:35:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205815150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:35:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937763170] [2023-11-23 20:35:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:35,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:35,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:35,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:35,894 INFO L87 Difference]: Start difference. First operand 3201 states and 10976 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:36,234 INFO L93 Difference]: Finished difference Result 3775 states and 12679 transitions. [2023-11-23 20:35:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:35:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-23 20:35:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:36,294 INFO L225 Difference]: With dead ends: 3775 [2023-11-23 20:35:36,294 INFO L226 Difference]: Without dead ends: 3089 [2023-11-23 20:35:36,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:35:36,296 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:36,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 104 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2023-11-23 20:35:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3089. [2023-11-23 20:35:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 3088 states have (on average 3.4145077720207255) internal successors, (10544), 3088 states have internal predecessors, (10544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 10544 transitions. [2023-11-23 20:35:36,439 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 10544 transitions. Word has length 14 [2023-11-23 20:35:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 10544 transitions. [2023-11-23 20:35:36,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 10544 transitions. [2023-11-23 20:35:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:35:36,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:36,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:35:36,446 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-11-23 20:35:36,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 368195483, now seen corresponding path program 1 times [2023-11-23 20:35:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053604626] [2023-11-23 20:35:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:36,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053604626] [2023-11-23 20:35:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053604626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:36,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29187206] [2023-11-23 20:35:36,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:36,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:36,749 INFO L87 Difference]: Start difference. First operand 3089 states and 10544 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-11-23 20:35:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:37,066 INFO L93 Difference]: Finished difference Result 3299 states and 11067 transitions. [2023-11-23 20:35:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:35:37,067 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-11-23 20:35:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:37,121 INFO L225 Difference]: With dead ends: 3299 [2023-11-23 20:35:37,122 INFO L226 Difference]: Without dead ends: 2809 [2023-11-23 20:35:37,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:37,130 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 119 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2023-11-23 20:35:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2023-11-23 20:35:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2808 states have (on average 3.3903133903133904) internal successors, (9520), 2808 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 9520 transitions. [2023-11-23 20:35:37,263 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 9520 transitions. Word has length 16 [2023-11-23 20:35:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:37,263 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 9520 transitions. [2023-11-23 20:35:37,264 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-11-23 20:35:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 9520 transitions. [2023-11-23 20:35:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:35:37,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:37,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:37,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:35:37,269 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-11-23 20:35:37,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1397277589, now seen corresponding path program 1 times [2023-11-23 20:35:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073890236] [2023-11-23 20:35:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:37,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073890236] [2023-11-23 20:35:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073890236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:37,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977063937] [2023-11-23 20:35:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:37,499 INFO L87 Difference]: Start difference. First operand 2809 states and 9520 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-11-23 20:35:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:37,808 INFO L93 Difference]: Finished difference Result 3579 states and 11951 transitions. [2023-11-23 20:35:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:35:37,809 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-11-23 20:35:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:37,827 INFO L225 Difference]: With dead ends: 3579 [2023-11-23 20:35:37,827 INFO L226 Difference]: Without dead ends: 1864 [2023-11-23 20:35:37,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-23 20:35:37,839 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:37,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 103 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2023-11-23 20:35:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2023-11-23 20:35:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 3.2549651100375736) internal successors, (6064), 1863 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 6064 transitions. [2023-11-23 20:35:37,918 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 6064 transitions. Word has length 16 [2023-11-23 20:35:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:37,919 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 6064 transitions. [2023-11-23 20:35:37,920 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-11-23 20:35:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 6064 transitions. [2023-11-23 20:35:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 20:35:37,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:37,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:37,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:35:37,925 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-11-23 20:35:37,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 231249760, now seen corresponding path program 1 times [2023-11-23 20:35:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188473614] [2023-11-23 20:35:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:38,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188473614] [2023-11-23 20:35:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188473614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467359205] [2023-11-23 20:35:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:38,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:38,195 INFO L87 Difference]: Start difference. First operand 1864 states and 6064 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:38,441 INFO L93 Difference]: Finished difference Result 1984 states and 6350 transitions. [2023-11-23 20:35:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:35:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 20:35:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:38,458 INFO L225 Difference]: With dead ends: 1984 [2023-11-23 20:35:38,458 INFO L226 Difference]: Without dead ends: 1704 [2023-11-23 20:35:38,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:38,459 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:38,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2023-11-23 20:35:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2023-11-23 20:35:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.2272460364063416) internal successors, (5496), 1703 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 5496 transitions. [2023-11-23 20:35:38,542 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 5496 transitions. Word has length 19 [2023-11-23 20:35:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:38,543 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 5496 transitions. [2023-11-23 20:35:38,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 5496 transitions. [2023-11-23 20:35:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:35:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:38,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:38,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:35:38,549 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-11-23 20:35:38,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1832008833, now seen corresponding path program 1 times [2023-11-23 20:35:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:38,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103016347] [2023-11-23 20:35:38,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:38,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103016347] [2023-11-23 20:35:38,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103016347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:38,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332220692] [2023-11-23 20:35:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:38,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 20:35:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 20:35:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:38,797 INFO L87 Difference]: Start difference. First operand 1704 states and 5496 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:39,044 INFO L93 Difference]: Finished difference Result 2224 states and 7122 transitions. [2023-11-23 20:35:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:35:39,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 20:35:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:39,055 INFO L225 Difference]: With dead ends: 2224 [2023-11-23 20:35:39,055 INFO L226 Difference]: Without dead ends: 1094 [2023-11-23 20:35:39,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-23 20:35:39,057 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:39,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 76 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-11-23 20:35:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2023-11-23 20:35:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 3.1399817017383347) internal successors, (3432), 1093 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 3432 transitions. [2023-11-23 20:35:39,094 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 3432 transitions. Word has length 21 [2023-11-23 20:35:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:39,094 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 3432 transitions. [2023-11-23 20:35:39,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 3432 transitions. [2023-11-23 20:35:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 20:35:39,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:39,098 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-11-23 20:35:39,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:35:39,098 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-11-23 20:35:39,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -894454206, now seen corresponding path program 1 times [2023-11-23 20:35:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777803635] [2023-11-23 20:35:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:39,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:39,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777803635] [2023-11-23 20:35:39,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777803635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090221423] [2023-11-23 20:35:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:39,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:39,278 INFO L87 Difference]: Start difference. First operand 1094 states and 3432 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-11-23 20:35:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:39,367 INFO L93 Difference]: Finished difference Result 1062 states and 3152 transitions. [2023-11-23 20:35:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:39,368 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-11-23 20:35:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:39,375 INFO L225 Difference]: With dead ends: 1062 [2023-11-23 20:35:39,376 INFO L226 Difference]: Without dead ends: 914 [2023-11-23 20:35:39,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:39,377 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 32 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-11-23 20:35:39,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-23 20:35:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2023-11-23 20:35:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 3.0295728368017523) internal successors, (2766), 913 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 2766 transitions. [2023-11-23 20:35:39,409 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 2766 transitions. Word has length 22 [2023-11-23 20:35:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:39,409 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 2766 transitions. [2023-11-23 20:35:39,410 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-11-23 20:35:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 2766 transitions. [2023-11-23 20:35:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 20:35:39,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:39,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 20:35:39,413 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-11-23 20:35:39,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1855851075, now seen corresponding path program 1 times [2023-11-23 20:35:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092047156] [2023-11-23 20:35:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:39,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:39,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092047156] [2023-11-23 20:35:39,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092047156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:39,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:35:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228179715] [2023-11-23 20:35:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:39,612 INFO L87 Difference]: Start difference. First operand 914 states and 2766 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:39,735 INFO L93 Difference]: Finished difference Result 710 states and 1994 transitions. [2023-11-23 20:35:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:35:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-23 20:35:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:39,741 INFO L225 Difference]: With dead ends: 710 [2023-11-23 20:35:39,741 INFO L226 Difference]: Without dead ends: 606 [2023-11-23 20:35:39,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:39,742 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:39,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-23 20:35:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2023-11-23 20:35:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.8198347107438018) internal successors, (1706), 605 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1706 transitions. [2023-11-23 20:35:39,762 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1706 transitions. Word has length 24 [2023-11-23 20:35:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:39,762 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1706 transitions. [2023-11-23 20:35:39,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1706 transitions. [2023-11-23 20:35:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 20:35:39,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:39,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:39,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 20:35:39,765 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-11-23 20:35:39,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 127519278, now seen corresponding path program 1 times [2023-11-23 20:35:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:39,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593397299] [2023-11-23 20:35:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:40,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593397299] [2023-11-23 20:35:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593397299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:40,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:40,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101790731] [2023-11-23 20:35:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:40,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:40,077 INFO L87 Difference]: Start difference. First operand 606 states and 1706 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-11-23 20:35:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:40,194 INFO L93 Difference]: Finished difference Result 430 states and 1166 transitions. [2023-11-23 20:35:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:40,195 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-11-23 20:35:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:40,197 INFO L225 Difference]: With dead ends: 430 [2023-11-23 20:35:40,197 INFO L226 Difference]: Without dead ends: 386 [2023-11-23 20:35:40,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:40,198 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:40,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-23 20:35:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-23 20:35:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.7168831168831167) internal successors, (1046), 385 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1046 transitions. [2023-11-23 20:35:40,211 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1046 transitions. Word has length 26 [2023-11-23 20:35:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:40,211 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1046 transitions. [2023-11-23 20:35:40,211 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-11-23 20:35:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1046 transitions. [2023-11-23 20:35:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 20:35:40,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:40,215 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] [2023-11-23 20:35:40,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 20:35:40,215 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-11-23 20:35:40,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash 586599021, now seen corresponding path program 1 times [2023-11-23 20:35:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775135971] [2023-11-23 20:35:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:41,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775135971] [2023-11-23 20:35:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775135971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 20:35:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573648925] [2023-11-23 20:35:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:41,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 20:35:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 20:35:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:41,507 INFO L87 Difference]: Start difference. First operand 386 states and 1046 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:41,850 INFO L93 Difference]: Finished difference Result 576 states and 1555 transitions. [2023-11-23 20:35:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 20:35:41,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2023-11-23 20:35:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:41,852 INFO L225 Difference]: With dead ends: 576 [2023-11-23 20:35:41,852 INFO L226 Difference]: Without dead ends: 320 [2023-11-23 20:35:41,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-23 20:35:41,853 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:41,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-23 20:35:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2023-11-23 20:35:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.6489028213166144) internal successors, (845), 319 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 845 transitions. [2023-11-23 20:35:41,883 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 845 transitions. Word has length 29 [2023-11-23 20:35:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:41,883 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 845 transitions. [2023-11-23 20:35:41,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 845 transitions. [2023-11-23 20:35:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 20:35:41,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:41,888 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] [2023-11-23 20:35:41,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 20:35:41,889 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-11-23 20:35:41,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2121155855, now seen corresponding path program 2 times [2023-11-23 20:35:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:41,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618322494] [2023-11-23 20:35:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:43,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618322494] [2023-11-23 20:35:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618322494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:43,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 20:35:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553235758] [2023-11-23 20:35:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 20:35:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 20:35:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:43,061 INFO L87 Difference]: Start difference. First operand 320 states and 845 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:43,309 INFO L93 Difference]: Finished difference Result 432 states and 1131 transitions. [2023-11-23 20:35:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 20:35:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2023-11-23 20:35:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:43,311 INFO L225 Difference]: With dead ends: 432 [2023-11-23 20:35:43,311 INFO L226 Difference]: Without dead ends: 266 [2023-11-23 20:35:43,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-23 20:35:43,312 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:43,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 139 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-23 20:35:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-23 20:35:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.543396226415094) internal successors, (674), 265 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 674 transitions. [2023-11-23 20:35:43,322 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 674 transitions. Word has length 29 [2023-11-23 20:35:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:43,322 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 674 transitions. [2023-11-23 20:35:43,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 674 transitions. [2023-11-23 20:35:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 20:35:43,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:43,324 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] [2023-11-23 20:35:43,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 20:35:43,325 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-11-23 20:35:43,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1329983059, now seen corresponding path program 3 times [2023-11-23 20:35:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:43,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324856530] [2023-11-23 20:35:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:35:43,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 20:35:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:35:43,518 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 20:35:43,519 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 20:35:43,520 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-23 20:35:43,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-23 20:35:43,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-23 20:35:43,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-23 20:35:43,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-23 20:35:43,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-23 20:35:43,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 20:35:43,529 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:43,535 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 20:35:43,535 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 20:35:43,614 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 20:35:43,616 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 20:35:43,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 20:35:43,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:35:43 BasicIcfg [2023-11-23 20:35:43,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 20:35:43,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 20:35:43,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 20:35:43,663 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 20:35:43,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:33" (3/4) ... [2023-11-23 20:35:43,664 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 20:35:43,685 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 20:35:43,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 20:35:43,688 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 20:35:43,771 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/witness.graphml [2023-11-23 20:35:43,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 20:35:43,772 INFO L158 Benchmark]: Toolchain (without parser) took 11797.83ms. Allocated memory was 121.6MB in the beginning and 320.9MB in the end (delta: 199.2MB). Free memory was 85.4MB in the beginning and 70.3MB in the end (delta: 15.1MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,772 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory was 93.2MB in the beginning and 93.1MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:35:43,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.02ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 61.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.63ms. Allocated memory is still 121.6MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,773 INFO L158 Benchmark]: Boogie Preprocessor took 52.11ms. Allocated memory is still 121.6MB. Free memory was 59.2MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,774 INFO L158 Benchmark]: RCFGBuilder took 921.66ms. Allocated memory is still 121.6MB. Free memory was 57.4MB in the beginning and 55.5MB in the end (delta: 2.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,775 INFO L158 Benchmark]: TraceAbstraction took 9931.39ms. Allocated memory was 121.6MB in the beginning and 320.9MB in the end (delta: 199.2MB). Free memory was 55.0MB in the beginning and 81.9MB in the end (delta: -26.9MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,775 INFO L158 Benchmark]: Witness Printer took 108.84ms. Allocated memory is still 320.9MB. Free memory was 81.9MB in the beginning and 70.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 20:35:43,777 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.32ms. Allocated memory is still 121.6MB. Free memory was 93.2MB in the beginning and 93.1MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.02ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 61.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.63ms. Allocated memory is still 121.6MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.11ms. Allocated memory is still 121.6MB. Free memory was 59.2MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 921.66ms. Allocated memory is still 121.6MB. Free memory was 57.4MB in the beginning and 55.5MB in the end (delta: 2.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9931.39ms. Allocated memory was 121.6MB in the beginning and 320.9MB in the end (delta: 199.2MB). Free memory was 55.0MB in the beginning and 81.9MB in the end (delta: -26.9MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. * Witness Printer took 108.84ms. Allocated memory is still 320.9MB. Free memory was 81.9MB in the beginning and 70.3MB in the end (delta: 11.5MB). 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 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; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={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, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={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, z=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_p0_EBX=0, __unbuffered_p2_EAX=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, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={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, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, z=1] [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_p0_EBX=0, __unbuffered_p2_EAX=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, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, z=1] [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_EBX = 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] [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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={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=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, z=1] - 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, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 928 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1247 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 248 mSDtfsCounter, 1247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3950occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 20:35:43,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c50d22-c7f8-4f46-b275-fa8f2c329776/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE