./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --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 a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 19:59:37,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:59:37,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:59:37,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:59:37,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:59:37,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:59:37,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:59:37,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:59:37,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:59:37,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:59:37,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:59:37,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:59:37,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:59:37,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:59:37,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:59:37,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:59:37,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:59:37,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:59:37,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:59:37,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:59:37,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:59:37,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:59:37,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:59:37,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:59:37,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:59:37,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:59:37,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:59:37,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:59:37,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:59:37,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:59:37,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:59:37,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:59:37,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:59:37,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:59:37,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:59:37,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:59:37,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:59:37,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:59:37,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:59:37,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:59:37,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:59:37,593 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 19:59:37,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:59:37,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:59:37,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:59:37,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:59:37,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:59:37,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:59:37,621 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:59:37,621 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:59:37,621 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:59:37,621 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:59:37,622 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:59:37,622 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:59:37,622 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:59:37,622 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:59:37,623 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:59:37,623 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:59:37,623 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:59:37,623 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:59:37,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:59:37,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 19:59:37,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:59:37,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 19:59:37,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:59:37,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:59:37,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:59:37,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:59:37,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 19:59:37,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:59:37,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:59:37,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:59:37,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:59:37,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:59:37,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:59:37,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:59:37,628 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:59:37,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:59:37,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:59:37,629 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:59:37,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:59:37,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:59:37,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:59:37,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/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_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 [2022-11-20 19:59:37,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:59:37,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:59:37,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:59:37,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:59:37,922 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:59:37,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-11-20 19:59:41,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:59:41,349 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:59:41,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-11-20 19:59:41,364 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/data/b89c591c6/331aec1e2fd8492392279170c2acff9f/FLAGa3a16ccc4 [2022-11-20 19:59:41,379 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/data/b89c591c6/331aec1e2fd8492392279170c2acff9f [2022-11-20 19:59:41,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:59:41,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:59:41,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:59:41,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:59:41,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:59:41,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:59:41" (1/1) ... [2022-11-20 19:59:41,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6fa300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:41, skipping insertion in model container [2022-11-20 19:59:41,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:59:41" (1/1) ... [2022-11-20 19:59:41,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:59:41,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:59:41,672 WARN L237 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_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2022-11-20 19:59:42,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:59:42,024 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:59:42,039 WARN L237 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_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2022-11-20 19:59:42,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:59:42,171 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:59:42,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42 WrapperNode [2022-11-20 19:59:42,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:59:42,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:59:42,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:59:42,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:59:42,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,242 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-20 19:59:42,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:59:42,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:59:42,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:59:42,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:59:42,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:59:42,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:59:42,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:59:42,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:59:42,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (1/1) ... [2022-11-20 19:59:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:59:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:59:42,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:59:42,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:59:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 19:59:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 19:59:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:59:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:59:42,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:59:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 19:59:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 19:59:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 19:59:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 19:59:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 19:59:42,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 19:59:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 19:59:42,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 19:59:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:59:42,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 19:59:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:59:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:59:42,404 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 19:59:42,587 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:59:42,589 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:59:43,130 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:59:43,321 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:59:43,321 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 19:59:43,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:59:43 BoogieIcfgContainer [2022-11-20 19:59:43,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:59:43,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:59:43,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:59:43,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:59:43,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:59:41" (1/3) ... [2022-11-20 19:59:43,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e997608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:59:43, skipping insertion in model container [2022-11-20 19:59:43,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:59:42" (2/3) ... [2022-11-20 19:59:43,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e997608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:59:43, skipping insertion in model container [2022-11-20 19:59:43,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:59:43" (3/3) ... [2022-11-20 19:59:43,337 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2022-11-20 19:59:43,348 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 19:59:43,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:59:43,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 19:59:43,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 19:59:43,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 19:59:43,484 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 19:59:43,498 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-20 19:59:43,500 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-20 19:59:43,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-11-20 19:59:43,561 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-20 19:59:43,561 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 19:59:43,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-20 19:59:43,570 INFO L119 LiptonReduction]: Number of co-enabled transitions 2934 [2022-11-20 19:59:49,013 INFO L134 LiptonReduction]: Checked pairs total: 7205 [2022-11-20 19:59:49,013 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-11-20 19:59:49,021 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2022-11-20 19:59:49,182 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 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) [2022-11-20 19:59:49,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:59:49,208 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=LoopsAndPotentialCycles, 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;@5679acf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:59:49,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 19:59:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 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) [2022-11-20 19:59:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 19:59:49,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:49,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:49,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1942866652, now seen corresponding path program 1 times [2022-11-20 19:59:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:49,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016394610] [2022-11-20 19:59:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:49,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016394610] [2022-11-20 19:59:49,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016394610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:49,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:49,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 19:59:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181659376] [2022-11-20 19:59:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:49,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:59:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:49,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:59:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:59:49,821 INFO L87 Difference]: Start difference. First operand has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-11-20 19:59:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:49,948 INFO L93 Difference]: Finished difference Result 2154 states and 8176 transitions. [2022-11-20 19:59:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:59:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-11-20 19:59:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:50,033 INFO L225 Difference]: With dead ends: 2154 [2022-11-20 19:59:50,033 INFO L226 Difference]: Without dead ends: 2090 [2022-11-20 19:59:50,034 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 [2022-11-20 19:59:50,041 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:50,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-20 19:59:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2022-11-20 19:59:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 3.814265198659646) internal successors, (7968), 2089 states have internal predecessors, (7968), 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) [2022-11-20 19:59:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2022-11-20 19:59:50,208 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2022-11-20 19:59:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:50,209 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2022-11-20 19:59:50,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-11-20 19:59:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2022-11-20 19:59:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 19:59:50,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:50,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:50,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:59:50,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash 963087420, now seen corresponding path program 1 times [2022-11-20 19:59:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:50,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263316520] [2022-11-20 19:59:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:50,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263316520] [2022-11-20 19:59:50,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263316520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:50,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:50,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:59:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466074346] [2022-11-20 19:59:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:50,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:59:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:50,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:59:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:59:50,599 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:50,847 INFO L93 Difference]: Finished difference Result 2218 states and 8192 transitions. [2022-11-20 19:59:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:59:50,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 19:59:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:50,865 INFO L225 Difference]: With dead ends: 2218 [2022-11-20 19:59:50,865 INFO L226 Difference]: Without dead ends: 1834 [2022-11-20 19:59:50,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:50,868 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:50,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2022-11-20 19:59:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2022-11-20 19:59:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 3.7534097108565194) internal successors, (6880), 1833 states have internal predecessors, (6880), 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) [2022-11-20 19:59:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6880 transitions. [2022-11-20 19:59:50,976 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6880 transitions. Word has length 12 [2022-11-20 19:59:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:50,977 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 6880 transitions. [2022-11-20 19:59:50,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6880 transitions. [2022-11-20 19:59:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 19:59:50,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:50,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 19:59:50,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 674012640, now seen corresponding path program 1 times [2022-11-20 19:59:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:50,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996370769] [2022-11-20 19:59:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:51,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:51,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996370769] [2022-11-20 19:59:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996370769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:51,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:51,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:59:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815433611] [2022-11-20 19:59:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:59:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:59:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:51,385 INFO L87 Difference]: Start difference. First operand 1834 states and 6880 transitions. Second operand has 5 states, 4 states have (on average 3.5) 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) [2022-11-20 19:59:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:51,708 INFO L93 Difference]: Finished difference Result 2962 states and 10572 transitions. [2022-11-20 19:59:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:59:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) 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 [2022-11-20 19:59:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:51,728 INFO L225 Difference]: With dead ends: 2962 [2022-11-20 19:59:51,729 INFO L226 Difference]: Without dead ends: 2510 [2022-11-20 19:59:51,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:59:51,733 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:51,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 12 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:59:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2022-11-20 19:59:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2082. [2022-11-20 19:59:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2081 states have (on average 3.6828447861604996) internal successors, (7664), 2081 states have internal predecessors, (7664), 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) [2022-11-20 19:59:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 7664 transitions. [2022-11-20 19:59:51,853 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 7664 transitions. Word has length 14 [2022-11-20 19:59:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:51,853 INFO L495 AbstractCegarLoop]: Abstraction has 2082 states and 7664 transitions. [2022-11-20 19:59:51,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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) [2022-11-20 19:59:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 7664 transitions. [2022-11-20 19:59:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 19:59:51,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:51,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:51,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 19:59:51,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1067409246, now seen corresponding path program 1 times [2022-11-20 19:59:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:51,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880923272] [2022-11-20 19:59:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:52,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880923272] [2022-11-20 19:59:52,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880923272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:52,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:52,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 19:59:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396773979] [2022-11-20 19:59:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:52,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:59:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:59:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:59:52,101 INFO L87 Difference]: Start difference. First operand 2082 states and 7664 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:52,194 INFO L93 Difference]: Finished difference Result 1636 states and 5438 transitions. [2022-11-20 19:59:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:59:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 19:59:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:52,228 INFO L225 Difference]: With dead ends: 1636 [2022-11-20 19:59:52,229 INFO L226 Difference]: Without dead ends: 1636 [2022-11-20 19:59:52,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:59:52,230 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:52,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-20 19:59:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2022-11-20 19:59:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 3.325993883792049) internal successors, (5438), 1635 states have internal predecessors, (5438), 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) [2022-11-20 19:59:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 5438 transitions. [2022-11-20 19:59:52,293 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 5438 transitions. Word has length 15 [2022-11-20 19:59:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:52,294 INFO L495 AbstractCegarLoop]: Abstraction has 1636 states and 5438 transitions. [2022-11-20 19:59:52,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 5438 transitions. [2022-11-20 19:59:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 19:59:52,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:52,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:52,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 19:59:52,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1356542782, now seen corresponding path program 1 times [2022-11-20 19:59:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:52,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717782321] [2022-11-20 19:59:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:52,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717782321] [2022-11-20 19:59:52,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717782321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:52,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:52,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:59:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009490326] [2022-11-20 19:59:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:52,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:59:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:59:52,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:52,554 INFO L87 Difference]: Start difference. First operand 1636 states and 5438 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:52,766 INFO L93 Difference]: Finished difference Result 2312 states and 7436 transitions. [2022-11-20 19:59:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:59:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 19:59:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:52,775 INFO L225 Difference]: With dead ends: 2312 [2022-11-20 19:59:52,776 INFO L226 Difference]: Without dead ends: 1526 [2022-11-20 19:59:52,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:59:52,777 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:52,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 13 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:59:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-11-20 19:59:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1328. [2022-11-20 19:59:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.2102486812358704) internal successors, (4260), 1327 states have internal predecessors, (4260), 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) [2022-11-20 19:59:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4260 transitions. [2022-11-20 19:59:52,842 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4260 transitions. Word has length 17 [2022-11-20 19:59:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:52,843 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 4260 transitions. [2022-11-20 19:59:52,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4260 transitions. [2022-11-20 19:59:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 19:59:52,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:52,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:52,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 19:59:52,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 111559189, now seen corresponding path program 1 times [2022-11-20 19:59:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873524964] [2022-11-20 19:59:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:53,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873524964] [2022-11-20 19:59:53,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873524964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:53,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:53,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:59:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104244357] [2022-11-20 19:59:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:53,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:59:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:53,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:59:53,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:59:53,033 INFO L87 Difference]: Start difference. First operand 1328 states and 4260 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:53,144 INFO L93 Difference]: Finished difference Result 842 states and 2378 transitions. [2022-11-20 19:59:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:59:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 19:59:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:53,149 INFO L225 Difference]: With dead ends: 842 [2022-11-20 19:59:53,149 INFO L226 Difference]: Without dead ends: 842 [2022-11-20 19:59:53,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:59:53,150 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:53,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 9 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-20 19:59:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-11-20 19:59:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.8275862068965516) internal successors, (2378), 841 states have internal predecessors, (2378), 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) [2022-11-20 19:59:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2378 transitions. [2022-11-20 19:59:53,178 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2378 transitions. Word has length 17 [2022-11-20 19:59:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:53,178 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 2378 transitions. [2022-11-20 19:59:53,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2378 transitions. [2022-11-20 19:59:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 19:59:53,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:53,181 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] [2022-11-20 19:59:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 19:59:53,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash 991840247, now seen corresponding path program 1 times [2022-11-20 19:59:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:53,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791936210] [2022-11-20 19:59:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:53,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:53,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791936210] [2022-11-20 19:59:53,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791936210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:53,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:53,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:59:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564148456] [2022-11-20 19:59:53,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:53,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:59:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:59:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:53,406 INFO L87 Difference]: Start difference. First operand 842 states and 2378 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:53,546 INFO L93 Difference]: Finished difference Result 608 states and 1696 transitions. [2022-11-20 19:59:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:59:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 19:59:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:53,550 INFO L225 Difference]: With dead ends: 608 [2022-11-20 19:59:53,551 INFO L226 Difference]: Without dead ends: 608 [2022-11-20 19:59:53,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:53,552 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:53,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 12 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-20 19:59:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2022-11-20 19:59:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.7940691927512358) internal successors, (1696), 607 states have internal predecessors, (1696), 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) [2022-11-20 19:59:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1696 transitions. [2022-11-20 19:59:53,575 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1696 transitions. Word has length 20 [2022-11-20 19:59:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:53,576 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 1696 transitions. [2022-11-20 19:59:53,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1696 transitions. [2022-11-20 19:59:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 19:59:53,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:53,578 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] [2022-11-20 19:59:53,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 19:59:53,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1385413911, now seen corresponding path program 1 times [2022-11-20 19:59:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:53,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490452392] [2022-11-20 19:59:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:53,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:53,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490452392] [2022-11-20 19:59:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490452392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:53,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:53,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:59:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870781767] [2022-11-20 19:59:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:53,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:59:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:59:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:53,837 INFO L87 Difference]: Start difference. First operand 608 states and 1696 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:54,024 INFO L93 Difference]: Finished difference Result 838 states and 2251 transitions. [2022-11-20 19:59:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:59:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 19:59:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:54,028 INFO L225 Difference]: With dead ends: 838 [2022-11-20 19:59:54,028 INFO L226 Difference]: Without dead ends: 564 [2022-11-20 19:59:54,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:59:54,029 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:54,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:59:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-20 19:59:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 560. [2022-11-20 19:59:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.5688729874776386) internal successors, (1436), 559 states have internal predecessors, (1436), 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) [2022-11-20 19:59:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1436 transitions. [2022-11-20 19:59:54,046 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1436 transitions. Word has length 23 [2022-11-20 19:59:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:54,047 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1436 transitions. [2022-11-20 19:59:54,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1436 transitions. [2022-11-20 19:59:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 19:59:54,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:54,049 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] [2022-11-20 19:59:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 19:59:54,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 547785071, now seen corresponding path program 2 times [2022-11-20 19:59:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:54,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926212270] [2022-11-20 19:59:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:54,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:54,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926212270] [2022-11-20 19:59:54,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926212270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:54,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:54,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:59:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310112947] [2022-11-20 19:59:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:54,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:59:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:59:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:59:54,306 INFO L87 Difference]: Start difference. First operand 560 states and 1436 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:54,436 INFO L93 Difference]: Finished difference Result 510 states and 1340 transitions. [2022-11-20 19:59:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:59:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 19:59:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:54,438 INFO L225 Difference]: With dead ends: 510 [2022-11-20 19:59:54,438 INFO L226 Difference]: Without dead ends: 210 [2022-11-20 19:59:54,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:59:54,439 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:54,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 10 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-20 19:59:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-20 19:59:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.4210526315789473) internal successors, (506), 209 states have internal predecessors, (506), 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) [2022-11-20 19:59:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2022-11-20 19:59:54,448 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 23 [2022-11-20 19:59:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:54,449 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2022-11-20 19:59:54,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:59:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2022-11-20 19:59:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 19:59:54,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:54,450 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] [2022-11-20 19:59:54,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 19:59:54,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 146479855, now seen corresponding path program 1 times [2022-11-20 19:59:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:54,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980798136] [2022-11-20 19:59:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:54,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:54,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980798136] [2022-11-20 19:59:54,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980798136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:54,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:54,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:59:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753088430] [2022-11-20 19:59:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:54,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:59:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:59:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:59:54,784 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand has 5 states, 4 states have (on average 6.5) 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) [2022-11-20 19:59:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:54,918 INFO L93 Difference]: Finished difference Result 276 states and 656 transitions. [2022-11-20 19:59:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:59:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) 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 [2022-11-20 19:59:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:54,920 INFO L225 Difference]: With dead ends: 276 [2022-11-20 19:59:54,920 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 19:59:54,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:59:54,921 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:54,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:59:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 19:59:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-20 19:59:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.0875) internal successors, (167), 80 states have internal predecessors, (167), 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) [2022-11-20 19:59:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions. [2022-11-20 19:59:54,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 26 [2022-11-20 19:59:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions. [2022-11-20 19:59:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) 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) [2022-11-20 19:59:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions. [2022-11-20 19:59:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 19:59:54,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:54,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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:54,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 19:59:54,926 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 345225737, now seen corresponding path program 2 times [2022-11-20 19:59:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740722976] [2022-11-20 19:59:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:59:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:59:56,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:59:56,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740722976] [2022-11-20 19:59:56,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740722976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:59:56,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:59:56,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:59:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664089651] [2022-11-20 19:59:56,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:59:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:59:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:59:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:59:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:59:56,305 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2022-11-20 19:59:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:59:56,579 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2022-11-20 19:59:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:59:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 [2022-11-20 19:59:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:59:56,580 INFO L225 Difference]: With dead ends: 100 [2022-11-20 19:59:56,580 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 19:59:56,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 19:59:56,581 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:59:56,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:59:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 19:59:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-20 19:59:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 52 states have internal predecessors, (91), 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) [2022-11-20 19:59:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2022-11-20 19:59:56,584 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26 [2022-11-20 19:59:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:59:56,584 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions. [2022-11-20 19:59:56,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2022-11-20 19:59:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2022-11-20 19:59:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 19:59:56,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:59:56,585 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] [2022-11-20 19:59:56,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 19:59:56,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 19:59:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:59:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash -666590259, now seen corresponding path program 3 times [2022-11-20 19:59:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:59:56,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471369143] [2022-11-20 19:59:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:59:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:59:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:59:56,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 19:59:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 19:59:56,759 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 19:59:56,760 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 19:59:56,761 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-20 19:59:56,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-20 19:59:56,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-20 19:59:56,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-20 19:59:56,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-20 19:59:56,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-20 19:59:56,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-20 19:59:56,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 19:59:56,766 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:59:56,772 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 19:59:56,772 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 19:59:56,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:59:56 BasicIcfg [2022-11-20 19:59:56,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 19:59:56,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 19:59:56,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 19:59:56,876 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 19:59:56,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:59:43" (3/4) ... [2022-11-20 19:59:56,878 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 19:59:57,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 19:59:57,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 19:59:57,001 INFO L158 Benchmark]: Toolchain (without parser) took 15609.15ms. Allocated memory was 148.9MB in the beginning and 262.1MB in the end (delta: 113.2MB). Free memory was 108.8MB in the beginning and 133.0MB in the end (delta: -24.2MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,002 INFO L158 Benchmark]: CDTParser took 4.29ms. Allocated memory is still 148.9MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 19:59:57,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.41ms. Allocated memory is still 148.9MB. Free memory was 108.3MB in the beginning and 84.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.04ms. Allocated memory is still 148.9MB. Free memory was 84.2MB in the beginning and 81.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,003 INFO L158 Benchmark]: Boogie Preprocessor took 67.55ms. Allocated memory is still 148.9MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,004 INFO L158 Benchmark]: RCFGBuilder took 1013.29ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 79.6MB in the beginning and 131.5MB in the end (delta: -51.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,004 INFO L158 Benchmark]: TraceAbstraction took 13547.51ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.5MB in the beginning and 149.8MB in the end (delta: -19.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,007 INFO L158 Benchmark]: Witness Printer took 125.28ms. Allocated memory is still 262.1MB. Free memory was 148.7MB in the beginning and 133.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 19:59:57,009 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.29ms. Allocated memory is still 148.9MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.41ms. Allocated memory is still 148.9MB. Free memory was 108.3MB in the beginning and 84.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.04ms. Allocated memory is still 148.9MB. Free memory was 84.2MB in the beginning and 81.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.55ms. Allocated memory is still 148.9MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.29ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 79.6MB in the beginning and 131.5MB in the end (delta: -51.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13547.51ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 130.5MB in the beginning and 149.8MB in the end (delta: -19.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 125.28ms. Allocated memory is still 262.1MB. Free memory was 148.7MB in the beginning and 133.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 146 PlacesBefore, 45 PlacesAfterwards, 135 TransitionsBefore, 33 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 7205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4210, independent: 4028, independent conditional: 0, independent unconditional: 4028, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2189, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2189, independent: 2116, independent conditional: 0, independent unconditional: 2116, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 277, dependent conditional: 0, dependent unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4210, independent: 1886, independent conditional: 0, independent unconditional: 1886, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 2189, unknown conditional: 0, unknown unconditional: 2189] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-1, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=0, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=1, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=2, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1070 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 55 mSDtfsCounter, 1070 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2538occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 630 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 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! [2022-11-20 19:59:57,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33c200ac-4dd1-4970-b1be-88b4f8d1cfa3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE