./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI --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 f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 --- 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-5e519f3 [2022-11-03 02:24:23,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:24:23,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:24:23,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:24:23,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:24:23,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:24:23,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:24:23,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:24:23,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:24:23,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:24:23,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:24:23,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:24:23,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:24:23,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:24:23,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:24:23,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:24:23,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:24:23,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:24:23,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:24:23,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:24:23,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:24:23,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:24:23,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:24:23,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:24:23,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:24:23,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:24:23,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:24:23,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:24:23,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:24:23,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:24:23,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:24:23,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:24:23,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:24:23,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:24:23,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:24:23,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:24:23,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:24:23,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:24:23,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:24:23,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:24:23,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:24:23,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:24:23,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:24:23,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:24:23,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:24:23,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:24:23,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:24:23,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:24:23,463 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:24:23,464 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:24:23,464 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:24:23,465 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:24:23,466 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:24:23,466 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:24:23,466 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:24:23,467 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:24:23,467 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:24:23,467 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:24:23,467 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:24:23,468 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:24:23,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:24:23,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:24:23,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:24:23,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:24:23,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:24:23,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:24:23,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:24:23,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:24:23,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:24:23,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:24:23,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:24:23,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:24:23,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:24:23,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:24:23,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:24:23,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:24:23,474 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:24:23,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:24:23,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:24:23,474 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:24:23,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:24:23,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:24:23,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:24:23,475 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_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/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_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI 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 -> f20fd36bba02e157a8b8bf1ebc392e6f77e4774b666ec7e51005ea908400e881 [2022-11-03 02:24:23,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:24:23,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:24:23,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:24:23,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:24:23,782 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:24:23,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i [2022-11-03 02:24:23,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/data/3c6c9c3ad/92a767ecccd44302a5499c689a0f6191/FLAG8185bcddd [2022-11-03 02:24:24,447 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:24:24,448 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i [2022-11-03 02:24:24,460 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/data/3c6c9c3ad/92a767ecccd44302a5499c689a0f6191/FLAG8185bcddd [2022-11-03 02:24:24,715 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/data/3c6c9c3ad/92a767ecccd44302a5499c689a0f6191 [2022-11-03 02:24:24,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:24:24,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:24:24,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:24:24,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:24:24,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:24:24,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:24:24" (1/1) ... [2022-11-03 02:24:24,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22535615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:24, skipping insertion in model container [2022-11-03 02:24:24,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:24:24" (1/1) ... [2022-11-03 02:24:24,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:24:24,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:24:25,052 WARN L230 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_cd904536-aa09-4263-92f6-de784763d91d/sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i[995,1008] [2022-11-03 02:24:25,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:24:25,415 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:24:25,431 WARN L230 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_cd904536-aa09-4263-92f6-de784763d91d/sv-benchmarks/c/pthread-wmm/safe009_power.oepc.i[995,1008] [2022-11-03 02:24:25,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:24:25,541 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:24:25,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25 WrapperNode [2022-11-03 02:24:25,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:24:25,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:24:25,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:24:25,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:24:25,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,595 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 258 [2022-11-03 02:24:25,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:24:25,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:24:25,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:24:25,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:24:25,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:24:25,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:24:25,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:24:25,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:24:25,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (1/1) ... [2022-11-03 02:24:25,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:24:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:24:25,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:24:25,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:24:25,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:24:25,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:24:25,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:24:25,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:24:25,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:24:25,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:24:25,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 02:24:25,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 02:24:25,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 02:24:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 02:24:25,771 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-03 02:24:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-03 02:24:25,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:24:25,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:24:25,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:24:25,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:24:25,774 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:24:25,998 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:24:26,000 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:24:26,912 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:24:27,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:24:27,831 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:24:27,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:24:27 BoogieIcfgContainer [2022-11-03 02:24:27,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:24:27,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:24:27,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:24:27,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:24:27,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:24:24" (1/3) ... [2022-11-03 02:24:27,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1842be8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:24:27, skipping insertion in model container [2022-11-03 02:24:27,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:24:25" (2/3) ... [2022-11-03 02:24:27,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1842be8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:24:27, skipping insertion in model container [2022-11-03 02:24:27,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:24:27" (3/3) ... [2022-11-03 02:24:27,844 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2022-11-03 02:24:27,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:24:27,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:24:27,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:24:27,864 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:24:27,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:24:28,031 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:24:28,048 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-03 02:24:28,057 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-03 02:24:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-03 02:24:28,138 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-03 02:24:28,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:24:28,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-11-03 02:24:28,145 INFO L118 LiptonReduction]: Number of co-enabled transitions 1760 [2022-11-03 02:24:51,919 WARN L234 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 566 DAG size of output: 532 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:25:13,152 INFO L133 LiptonReduction]: Checked pairs total: 4228 [2022-11-03 02:25:13,153 INFO L135 LiptonReduction]: Total number of compositions: 118 [2022-11-03 02:25:13,160 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2022-11-03 02:25:13,223 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 450 states, 449 states have (on average 3.202672605790646) internal successors, (1438), 449 states have internal predecessors, (1438), 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-03 02:25:13,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:25:13,249 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;@6f7e1f71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:25:13,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 02:25:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 450 states, 449 states have (on average 3.202672605790646) internal successors, (1438), 449 states have internal predecessors, (1438), 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-03 02:25:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:25:13,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:13,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:13,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1682682252, now seen corresponding path program 1 times [2022-11-03 02:25:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:13,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501862019] [2022-11-03 02:25:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:13,510 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-03 02:25:13,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:13,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501862019] [2022-11-03 02:25:13,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501862019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:13,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:13,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:25:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724239589] [2022-11-03 02:25:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:13,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:25:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:13,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:25:13,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:25:13,552 INFO L87 Difference]: Start difference. First operand has 450 states, 449 states have (on average 3.202672605790646) internal successors, (1438), 449 states have internal predecessors, (1438), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:13,657 INFO L93 Difference]: Finished difference Result 450 states and 1358 transitions. [2022-11-03 02:25:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:25:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:25:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:13,680 INFO L225 Difference]: With dead ends: 450 [2022-11-03 02:25:13,680 INFO L226 Difference]: Without dead ends: 450 [2022-11-03 02:25:13,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:25:13,686 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:13,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-03 02:25:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2022-11-03 02:25:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 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-03 02:25:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2022-11-03 02:25:13,794 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 8 [2022-11-03 02:25:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:13,796 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2022-11-03 02:25:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2022-11-03 02:25:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:25:13,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:13,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:13,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:25:13,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2145328155, now seen corresponding path program 1 times [2022-11-03 02:25:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:13,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364757996] [2022-11-03 02:25:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:14,559 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-03 02:25:14,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364757996] [2022-11-03 02:25:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364757996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:25:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81365447] [2022-11-03 02:25:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:14,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:25:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:14,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:25:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:25:14,572 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 02:25:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:14,780 INFO L93 Difference]: Finished difference Result 490 states and 1420 transitions. [2022-11-03 02:25:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:14,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-03 02:25:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:14,785 INFO L225 Difference]: With dead ends: 490 [2022-11-03 02:25:14,785 INFO L226 Difference]: Without dead ends: 410 [2022-11-03 02:25:14,786 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-03 02:25:14,787 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:14,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:25:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-03 02:25:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-03 02:25:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.9731051344743276) internal successors, (1216), 409 states have internal predecessors, (1216), 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-03 02:25:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1216 transitions. [2022-11-03 02:25:14,815 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1216 transitions. Word has length 10 [2022-11-03 02:25:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:14,816 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1216 transitions. [2022-11-03 02:25:14,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 02:25:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1216 transitions. [2022-11-03 02:25:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:25:14,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:14,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:14,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:25:14,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 178477839, now seen corresponding path program 1 times [2022-11-03 02:25:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:14,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503900572] [2022-11-03 02:25:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:15,318 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-03 02:25:15,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:15,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503900572] [2022-11-03 02:25:15,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503900572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:15,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:15,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:25:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946187075] [2022-11-03 02:25:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:15,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:25:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:25:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:25:15,321 INFO L87 Difference]: Start difference. First operand 410 states and 1216 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03 02:25:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:15,494 INFO L93 Difference]: Finished difference Result 446 states and 1279 transitions. [2022-11-03 02:25:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-03 02:25:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:15,498 INFO L225 Difference]: With dead ends: 446 [2022-11-03 02:25:15,498 INFO L226 Difference]: Without dead ends: 386 [2022-11-03 02:25:15,498 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-03 02:25:15,499 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:15,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-03 02:25:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-03 02:25:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.9454545454545453) internal successors, (1134), 385 states have internal predecessors, (1134), 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-03 02:25:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1134 transitions. [2022-11-03 02:25:15,516 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1134 transitions. Word has length 11 [2022-11-03 02:25:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:15,516 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1134 transitions. [2022-11-03 02:25:15,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03 02:25:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1134 transitions. [2022-11-03 02:25:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:25:15,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:15,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:15,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:25:15,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1237795171, now seen corresponding path program 1 times [2022-11-03 02:25:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:15,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991149195] [2022-11-03 02:25:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:15,963 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-03 02:25:15,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991149195] [2022-11-03 02:25:15,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991149195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:15,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:15,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:25:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925453770] [2022-11-03 02:25:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:25:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:25:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:25:15,972 INFO L87 Difference]: Start difference. First operand 386 states and 1134 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-03 02:25:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:16,202 INFO L93 Difference]: Finished difference Result 514 states and 1466 transitions. [2022-11-03 02:25:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:25:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-03 02:25:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:16,205 INFO L225 Difference]: With dead ends: 514 [2022-11-03 02:25:16,206 INFO L226 Difference]: Without dead ends: 242 [2022-11-03 02:25:16,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:25:16,209 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:16,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 10 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:25:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-03 02:25:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-03 02:25:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.680497925311203) internal successors, (646), 241 states have internal predecessors, (646), 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-03 02:25:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 646 transitions. [2022-11-03 02:25:16,225 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 646 transitions. Word has length 12 [2022-11-03 02:25:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 646 transitions. [2022-11-03 02:25:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-03 02:25:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 646 transitions. [2022-11-03 02:25:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:25:16,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:16,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:16,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:25:16,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1212481319, now seen corresponding path program 1 times [2022-11-03 02:25:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:16,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323744031] [2022-11-03 02:25:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:18,543 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-03 02:25:18,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:18,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323744031] [2022-11-03 02:25:18,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323744031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:18,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:18,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:25:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499964112] [2022-11-03 02:25:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:18,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:25:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:18,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:25:18,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:25:18,546 INFO L87 Difference]: Start difference. First operand 242 states and 646 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:18,773 INFO L93 Difference]: Finished difference Result 270 states and 698 transitions. [2022-11-03 02:25:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:18,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:25:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:18,776 INFO L225 Difference]: With dead ends: 270 [2022-11-03 02:25:18,776 INFO L226 Difference]: Without dead ends: 238 [2022-11-03 02:25:18,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:25:18,777 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:18,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:25:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-03 02:25:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-11-03 02:25:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.6666666666666665) internal successors, (632), 237 states have internal predecessors, (632), 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-03 02:25:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 632 transitions. [2022-11-03 02:25:18,788 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 632 transitions. Word has length 13 [2022-11-03 02:25:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:18,789 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 632 transitions. [2022-11-03 02:25:18,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 632 transitions. [2022-11-03 02:25:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:25:18,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:18,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:18,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:25:18,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1549375326, now seen corresponding path program 1 times [2022-11-03 02:25:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017127546] [2022-11-03 02:25:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:19,129 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-03 02:25:19,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:19,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017127546] [2022-11-03 02:25:19,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017127546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:19,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:19,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:25:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574501135] [2022-11-03 02:25:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:25:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:25:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:25:19,132 INFO L87 Difference]: Start difference. First operand 238 states and 632 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-03 02:25:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:19,209 INFO L93 Difference]: Finished difference Result 186 states and 436 transitions. [2022-11-03 02:25:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:25:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-03 02:25:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:19,211 INFO L225 Difference]: With dead ends: 186 [2022-11-03 02:25:19,211 INFO L226 Difference]: Without dead ends: 186 [2022-11-03 02:25:19,212 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-03 02:25:19,212 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:19,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-03 02:25:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-03 02:25:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.3567567567567567) internal successors, (436), 185 states have internal predecessors, (436), 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-03 02:25:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 436 transitions. [2022-11-03 02:25:19,219 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 436 transitions. Word has length 14 [2022-11-03 02:25:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:19,220 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 436 transitions. [2022-11-03 02:25:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-03 02:25:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 436 transitions. [2022-11-03 02:25:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:25:19,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:19,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:19,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:25:19,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash -527384320, now seen corresponding path program 1 times [2022-11-03 02:25:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:19,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030845372] [2022-11-03 02:25:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:19,574 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-03 02:25:19,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:19,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030845372] [2022-11-03 02:25:19,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030845372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:19,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:19,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:25:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374784142] [2022-11-03 02:25:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:19,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:25:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:19,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:25:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:25:19,578 INFO L87 Difference]: Start difference. First operand 186 states and 436 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03 02:25:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:19,695 INFO L93 Difference]: Finished difference Result 116 states and 230 transitions. [2022-11-03 02:25:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:25:19,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03 02:25:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:19,697 INFO L225 Difference]: With dead ends: 116 [2022-11-03 02:25:19,698 INFO L226 Difference]: Without dead ends: 116 [2022-11-03 02:25:19,698 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-03 02:25:19,699 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:19,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-03 02:25:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-03 02:25:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.0) internal successors, (230), 115 states have internal predecessors, (230), 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-03 02:25:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 230 transitions. [2022-11-03 02:25:19,705 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 230 transitions. Word has length 15 [2022-11-03 02:25:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:19,706 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 230 transitions. [2022-11-03 02:25:19,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03 02:25:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2022-11-03 02:25:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:25:19,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:19,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:19,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:25:19,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash -978761425, now seen corresponding path program 1 times [2022-11-03 02:25:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:19,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124372651] [2022-11-03 02:25:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:20,196 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-03 02:25:20,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:20,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124372651] [2022-11-03 02:25:20,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124372651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:20,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:20,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:25:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005460907] [2022-11-03 02:25:20,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:20,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:25:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:20,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:25:20,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:25:20,199 INFO L87 Difference]: Start difference. First operand 116 states and 230 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03 02:25:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:20,329 INFO L93 Difference]: Finished difference Result 86 states and 170 transitions. [2022-11-03 02:25:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03 02:25:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:20,330 INFO L225 Difference]: With dead ends: 86 [2022-11-03 02:25:20,330 INFO L226 Difference]: Without dead ends: 86 [2022-11-03 02:25:20,331 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-03 02:25:20,331 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:20,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-03 02:25:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-03 02:25:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.0) internal successors, (170), 85 states have internal predecessors, (170), 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-03 02:25:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 170 transitions. [2022-11-03 02:25:20,336 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 170 transitions. Word has length 17 [2022-11-03 02:25:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:20,336 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 170 transitions. [2022-11-03 02:25:20,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03 02:25:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 170 transitions. [2022-11-03 02:25:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:25:20,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:20,338 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-03 02:25:20,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:25:20,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash -588606053, now seen corresponding path program 1 times [2022-11-03 02:25:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:20,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044735341] [2022-11-03 02:25:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:22,519 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-03 02:25:22,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:22,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044735341] [2022-11-03 02:25:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044735341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:22,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:22,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:25:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915639473] [2022-11-03 02:25:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:22,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:25:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:22,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:25:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:25:22,522 INFO L87 Difference]: Start difference. First operand 86 states and 170 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:22,727 INFO L93 Difference]: Finished difference Result 119 states and 232 transitions. [2022-11-03 02:25:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:22,728 INFO L225 Difference]: With dead ends: 119 [2022-11-03 02:25:22,728 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 02:25:22,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:25:22,729 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:22,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:25:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 02:25:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-11-03 02:25:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.9452054794520548) internal successors, (142), 73 states have internal predecessors, (142), 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-03 02:25:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 142 transitions. [2022-11-03 02:25:22,736 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 142 transitions. Word has length 20 [2022-11-03 02:25:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:22,737 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 142 transitions. [2022-11-03 02:25:22,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 142 transitions. [2022-11-03 02:25:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:25:22,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:22,738 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-03 02:25:22,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:25:22,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -61307173, now seen corresponding path program 2 times [2022-11-03 02:25:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:22,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875610106] [2022-11-03 02:25:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:25:24,704 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-03 02:25:24,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:25:24,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875610106] [2022-11-03 02:25:24,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875610106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:25:24,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:25:24,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:25:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306378698] [2022-11-03 02:25:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:25:24,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:25:24,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:25:24,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:25:24,706 INFO L87 Difference]: Start difference. First operand 74 states and 142 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:25:24,838 INFO L93 Difference]: Finished difference Result 107 states and 204 transitions. [2022-11-03 02:25:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:25:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:25:24,840 INFO L225 Difference]: With dead ends: 107 [2022-11-03 02:25:24,840 INFO L226 Difference]: Without dead ends: 80 [2022-11-03 02:25:24,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:25:24,840 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:25:24,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:25:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-03 02:25:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2022-11-03 02:25:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 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-03 02:25:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 128 transitions. [2022-11-03 02:25:24,843 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 128 transitions. Word has length 20 [2022-11-03 02:25:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:25:24,844 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 128 transitions. [2022-11-03 02:25:24,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03 02:25:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 128 transitions. [2022-11-03 02:25:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:25:24,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:25:24,844 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-03 02:25:24,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:25:24,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:25:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:25:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2126078877, now seen corresponding path program 3 times [2022-11-03 02:25:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:25:24,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189543207] [2022-11-03 02:25:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:25:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:25:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:25:24,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:25:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:25:25,274 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:25:25,275 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:25:25,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-03 02:25:25,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-03 02:25:25,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-03 02:25:25,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-03 02:25:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:25:25,280 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:25:25,285 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 02:25:25,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:25:25,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:25:25 BasicIcfg [2022-11-03 02:25:25,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:25:25,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:25:25,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:25:25,437 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:25:25,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:24:27" (3/4) ... [2022-11-03 02:25:25,439 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:25:25,585 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:25:25,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:25:25,586 INFO L158 Benchmark]: Toolchain (without parser) took 60863.20ms. Allocated memory was 90.2MB in the beginning and 478.2MB in the end (delta: 388.0MB). Free memory was 55.7MB in the beginning and 397.4MB in the end (delta: -341.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,586 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 90.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:25:25,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.54ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 50.8MB in the end (delta: 4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.54ms. Allocated memory is still 90.2MB. Free memory was 50.8MB in the beginning and 47.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,587 INFO L158 Benchmark]: Boogie Preprocessor took 70.03ms. Allocated memory is still 90.2MB. Free memory was 47.8MB in the beginning and 44.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,587 INFO L158 Benchmark]: RCFGBuilder took 2166.67ms. Allocated memory was 90.2MB in the beginning and 138.4MB in the end (delta: 48.2MB). Free memory was 44.8MB in the beginning and 99.5MB in the end (delta: -54.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,588 INFO L158 Benchmark]: TraceAbstraction took 57598.10ms. Allocated memory was 138.4MB in the beginning and 478.2MB in the end (delta: 339.7MB). Free memory was 98.4MB in the beginning and 417.3MB in the end (delta: -318.9MB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,589 INFO L158 Benchmark]: Witness Printer took 148.85ms. Allocated memory is still 478.2MB. Free memory was 417.3MB in the beginning and 397.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 02:25:25,593 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 90.2MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.54ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 50.8MB in the end (delta: 4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.54ms. Allocated memory is still 90.2MB. Free memory was 50.8MB in the beginning and 47.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.03ms. Allocated memory is still 90.2MB. Free memory was 47.8MB in the beginning and 44.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2166.67ms. Allocated memory was 90.2MB in the beginning and 138.4MB in the end (delta: 48.2MB). Free memory was 44.8MB in the beginning and 99.5MB in the end (delta: -54.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57598.10ms. Allocated memory was 138.4MB in the beginning and 478.2MB in the end (delta: 339.7MB). Free memory was 98.4MB in the beginning and 417.3MB in the end (delta: -318.9MB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. * Witness Printer took 148.85ms. Allocated memory is still 478.2MB. Free memory was 417.3MB in the beginning and 397.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.1s, 138 PlacesBefore, 34 PlacesAfterwards, 130 TransitionsBefore, 25 TransitionsAfterwards, 1760 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 4228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1938, positive: 1769, positive conditional: 0, positive unconditional: 1769, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, positive: 1162, positive conditional: 0, positive unconditional: 1162, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1146, positive conditional: 0, positive unconditional: 1146, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17899, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 945, negative conditional: 0, negative unconditional: 945, unknown: 16911, unknown conditional: 0, unknown unconditional: 16911] ], Cache Queries: [ total: 1938, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=-1, t1985={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L765] EXPR 1 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))) [L765] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L766] EXPR 1 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))) [L766] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L767] EXPR 1 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L767] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L768] EXPR 1 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L768] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] EXPR 1 !y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L769] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] EXPR 1 !y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L770] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] EXPR 1 \read(y) [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L837] 0 pthread_t t1986; [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=0, t1985={7:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t1987; [L840] FCALL, FORK 0 pthread_create(&t1987, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1987, ((void *)0), P2, ((void *)0))=1, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 \read(y) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 840]: 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: 838]: 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: 836]: 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 7 procedures, 154 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 57.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 25 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 1153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:25:25,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd904536-aa09-4263-92f6-de784763d91d/bin/utaipan-7li7fVZpFI/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