./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.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_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/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_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/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_8a114c28-1230-4971-9118-877baeb57ad7/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 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- 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 03:40:06,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:40:06,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:40:06,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:40:06,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:40:06,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:40:06,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:40:06,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:40:06,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:40:06,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:40:06,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:40:06,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:40:06,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:40:06,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:40:06,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:40:06,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:40:06,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:40:06,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:40:06,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:40:06,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:40:06,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:40:06,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:40:06,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:40:06,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:40:06,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:40:06,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:40:06,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:40:06,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:40:06,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:40:06,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:40:06,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:40:06,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:40:06,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:40:06,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:40:06,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:40:06,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:40:06,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:40:06,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:40:06,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:40:06,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:40:06,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:40:06,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:40:06,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:40:06,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:40:06,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:40:06,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:40:06,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:40:06,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:40:06,705 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:40:06,705 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:40:06,705 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:40:06,706 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:40:06,707 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:40:06,707 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:40:06,707 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:40:06,707 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:40:06,708 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:40:06,708 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:40:06,708 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:40:06,708 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:40:06,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:40:06,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:40:06,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:40:06,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:40:06,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:40:06,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:40:06,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:40:06,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:40:06,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:40:06,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:40:06,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:40:06,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:40:06,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:40:06,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:40:06,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:40:06,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:40:06,713 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:40:06,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:40:06,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:40:06,713 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:40:06,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:40:06,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:40:06,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:40:06,716 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_8a114c28-1230-4971-9118-877baeb57ad7/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_8a114c28-1230-4971-9118-877baeb57ad7/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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2022-11-03 03:40:06,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:40:07,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:40:07,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:40:07,023 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:40:07,024 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:40:07,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:40:07,096 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/data/30c94f73c/09f2c17acf624f1b9558801850b30075/FLAGa0c116314 [2022-11-03 03:40:07,752 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:40:07,753 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:40:07,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/data/30c94f73c/09f2c17acf624f1b9558801850b30075/FLAGa0c116314 [2022-11-03 03:40:08,004 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/data/30c94f73c/09f2c17acf624f1b9558801850b30075 [2022-11-03 03:40:08,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:40:08,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:40:08,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:40:08,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:40:08,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:40:08,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f609ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08, skipping insertion in model container [2022-11-03 03:40:08,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:40:08,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:40:08,342 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_8a114c28-1230-4971-9118-877baeb57ad7/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 03:40:08,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:40:08,653 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:40:08,665 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_8a114c28-1230-4971-9118-877baeb57ad7/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 03:40:08,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:40:08,739 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:40:08,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08 WrapperNode [2022-11-03 03:40:08,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:40:08,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:40:08,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:40:08,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:40:08,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,831 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 191 [2022-11-03 03:40:08,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:40:08,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:40:08,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:40:08,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:40:08,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:40:08,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:40:08,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:40:08,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:40:08,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (1/1) ... [2022-11-03 03:40:08,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:40:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:40:08,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:40:08,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:40:08,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:40:08,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:40:08,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:40:08,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:40:08,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:40:08,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 03:40:08,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 03:40:08,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 03:40:08,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 03:40:08,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-03 03:40:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-03 03:40:08,982 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-03 03:40:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-03 03:40:08,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:40:08,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:40:08,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:40:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:40:08,985 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 03:40:09,127 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:40:09,129 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:40:09,914 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:40:10,491 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:40:10,492 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:40:10,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:10 BoogieIcfgContainer [2022-11-03 03:40:10,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:40:10,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:40:10,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:40:10,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:40:10,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:40:08" (1/3) ... [2022-11-03 03:40:10,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb5d0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:40:10, skipping insertion in model container [2022-11-03 03:40:10,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:08" (2/3) ... [2022-11-03 03:40:10,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb5d0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:40:10, skipping insertion in model container [2022-11-03 03:40:10,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:10" (3/3) ... [2022-11-03 03:40:10,505 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:40:10,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:40:10,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:40:10,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 03:40:10,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:40:10,617 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:40:10,669 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:40:10,685 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-03 03:40:10,690 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-03 03:40:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-11-03 03:40:10,771 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-03 03:40:10,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:40:10,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-03 03:40:10,780 INFO L118 LiptonReduction]: Number of co-enabled transitions 3290 [2022-11-03 03:40:17,070 INFO L133 LiptonReduction]: Checked pairs total: 8837 [2022-11-03 03:40:17,070 INFO L135 LiptonReduction]: Total number of compositions: 114 [2022-11-03 03:40:17,078 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2022-11-03 03:40:17,306 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4374 states, 4371 states have (on average 4.132235186456189) internal successors, (18062), 4373 states have internal predecessors, (18062), 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 03:40:17,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:40:17,330 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;@66244b14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:40:17,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 03:40:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 4374 states, 4371 states have (on average 4.132235186456189) internal successors, (18062), 4373 states have internal predecessors, (18062), 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 03:40:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:40:17,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:17,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:40:17,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1270287, now seen corresponding path program 1 times [2022-11-03 03:40:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232555970] [2022-11-03 03:40:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:17,798 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 03:40:17,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:17,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232555970] [2022-11-03 03:40:17,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232555970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:17,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:17,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:40:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301014373] [2022-11-03 03:40:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:40:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:40:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:40:17,867 INFO L87 Difference]: Start difference. First operand has 4374 states, 4371 states have (on average 4.132235186456189) internal successors, (18062), 4373 states have internal predecessors, (18062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 03:40:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:18,069 INFO L93 Difference]: Finished difference Result 3562 states and 13925 transitions. [2022-11-03 03:40:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:40:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-11-03 03:40:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:18,180 INFO L225 Difference]: With dead ends: 3562 [2022-11-03 03:40:18,180 INFO L226 Difference]: Without dead ends: 3437 [2022-11-03 03:40:18,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:40:18,185 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:18,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:40:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2022-11-03 03:40:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2022-11-03 03:40:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 3436 states have (on average 3.928987194412107) internal successors, (13500), 3436 states have internal predecessors, (13500), 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 03:40:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2022-11-03 03:40:18,465 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 3 [2022-11-03 03:40:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:18,466 INFO L495 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2022-11-03 03:40:18,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 03:40:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2022-11-03 03:40:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:40:18,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:18,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:18,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:40:18,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1977213463, now seen corresponding path program 1 times [2022-11-03 03:40:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984126787] [2022-11-03 03:40:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:18,997 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 03:40:18,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984126787] [2022-11-03 03:40:18,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984126787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:18,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:18,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:40:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109441606] [2022-11-03 03:40:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:19,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:40:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:40:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:40:19,002 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:19,353 INFO L93 Difference]: Finished difference Result 7156 states and 27042 transitions. [2022-11-03 03:40:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:40:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 03:40:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:19,395 INFO L225 Difference]: With dead ends: 7156 [2022-11-03 03:40:19,396 INFO L226 Difference]: Without dead ends: 5556 [2022-11-03 03:40:19,396 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 03:40:19,397 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:19,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 15 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2022-11-03 03:40:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 4578. [2022-11-03 03:40:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 4577 states have (on average 3.831767533318768) internal successors, (17538), 4577 states have internal predecessors, (17538), 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 03:40:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 17538 transitions. [2022-11-03 03:40:19,700 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 17538 transitions. Word has length 12 [2022-11-03 03:40:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:19,701 INFO L495 AbstractCegarLoop]: Abstraction has 4578 states and 17538 transitions. [2022-11-03 03:40:19,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 17538 transitions. [2022-11-03 03:40:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:40:19,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:19,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:19,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:40:19,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash -107068182, now seen corresponding path program 1 times [2022-11-03 03:40:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243499165] [2022-11-03 03:40:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:19,972 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 03:40:19,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:19,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243499165] [2022-11-03 03:40:19,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243499165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:19,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:19,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:40:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461442192] [2022-11-03 03:40:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:19,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:40:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:40:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:40:19,979 INFO L87 Difference]: Start difference. First operand 4578 states and 17538 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:40:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:20,310 INFO L93 Difference]: Finished difference Result 6348 states and 23337 transitions. [2022-11-03 03:40:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:40:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:40:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:20,365 INFO L225 Difference]: With dead ends: 6348 [2022-11-03 03:40:20,365 INFO L226 Difference]: Without dead ends: 5332 [2022-11-03 03:40:20,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:40:20,370 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:20,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 15 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2022-11-03 03:40:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 4354. [2022-11-03 03:40:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4354 states, 4353 states have (on average 3.814380886744774) internal successors, (16604), 4353 states have internal predecessors, (16604), 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 03:40:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 16604 transitions. [2022-11-03 03:40:20,617 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 16604 transitions. Word has length 13 [2022-11-03 03:40:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 4354 states and 16604 transitions. [2022-11-03 03:40:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:40:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 16604 transitions. [2022-11-03 03:40:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:40:20,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:20,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:20,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:40:20,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1174498003, now seen corresponding path program 1 times [2022-11-03 03:40:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:20,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427271128] [2022-11-03 03:40:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:20,846 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 03:40:20,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427271128] [2022-11-03 03:40:20,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427271128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:20,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:20,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:40:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574080066] [2022-11-03 03:40:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:40:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:40:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:40:20,849 INFO L87 Difference]: Start difference. First operand 4354 states and 16604 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:40:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:21,088 INFO L93 Difference]: Finished difference Result 4774 states and 17855 transitions. [2022-11-03 03:40:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:40:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:40:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:21,116 INFO L225 Difference]: With dead ends: 4774 [2022-11-03 03:40:21,116 INFO L226 Difference]: Without dead ends: 4274 [2022-11-03 03:40:21,116 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 03:40:21,117 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:21,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 13 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-11-03 03:40:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4274. [2022-11-03 03:40:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 3.800608471799672) internal successors, (16240), 4273 states have internal predecessors, (16240), 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 03:40:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 16240 transitions. [2022-11-03 03:40:21,332 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 16240 transitions. Word has length 13 [2022-11-03 03:40:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:21,333 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 16240 transitions. [2022-11-03 03:40:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 03:40:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 16240 transitions. [2022-11-03 03:40:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:40:21,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:21,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:21,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:40:21,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 965430860, now seen corresponding path program 1 times [2022-11-03 03:40:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:21,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810784139] [2022-11-03 03:40:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:21,491 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 03:40:21,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810784139] [2022-11-03 03:40:21,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810784139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:21,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:21,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:40:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628271817] [2022-11-03 03:40:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:21,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:40:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:40:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:40:21,494 INFO L87 Difference]: Start difference. First operand 4274 states and 16240 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 03:40:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:21,644 INFO L93 Difference]: Finished difference Result 4082 states and 13964 transitions. [2022-11-03 03:40:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:40:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 03:40:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:21,660 INFO L225 Difference]: With dead ends: 4082 [2022-11-03 03:40:21,660 INFO L226 Difference]: Without dead ends: 3154 [2022-11-03 03:40:21,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:40:21,661 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:21,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 12 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:40:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2022-11-03 03:40:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3154. [2022-11-03 03:40:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 3153 states have (on average 3.39232477006026) internal successors, (10696), 3153 states have internal predecessors, (10696), 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 03:40:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 10696 transitions. [2022-11-03 03:40:21,804 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 10696 transitions. Word has length 14 [2022-11-03 03:40:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:21,804 INFO L495 AbstractCegarLoop]: Abstraction has 3154 states and 10696 transitions. [2022-11-03 03:40:21,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 03:40:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 10696 transitions. [2022-11-03 03:40:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:40:21,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:21,809 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 03:40:21,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:40:21,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1641684943, now seen corresponding path program 1 times [2022-11-03 03:40:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:21,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266115792] [2022-11-03 03:40:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:21,976 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 03:40:21,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:21,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266115792] [2022-11-03 03:40:21,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266115792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:21,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:40:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723184756] [2022-11-03 03:40:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:21,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:40:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:40:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:40:21,978 INFO L87 Difference]: Start difference. First operand 3154 states and 10696 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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 03:40:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:22,243 INFO L93 Difference]: Finished difference Result 4965 states and 16388 transitions. [2022-11-03 03:40:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:40:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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 03:40:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:22,257 INFO L225 Difference]: With dead ends: 4965 [2022-11-03 03:40:22,257 INFO L226 Difference]: Without dead ends: 3285 [2022-11-03 03:40:22,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:40:22,258 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:22,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 17 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2022-11-03 03:40:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2835. [2022-11-03 03:40:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2834 states have (on average 3.276993648553282) internal successors, (9287), 2834 states have internal predecessors, (9287), 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 03:40:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 9287 transitions. [2022-11-03 03:40:22,345 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 9287 transitions. Word has length 17 [2022-11-03 03:40:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:22,346 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 9287 transitions. [2022-11-03 03:40:22,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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 03:40:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 9287 transitions. [2022-11-03 03:40:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:40:22,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:22,354 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 03:40:22,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:40:22,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1457419085, now seen corresponding path program 1 times [2022-11-03 03:40:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:22,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414696255] [2022-11-03 03:40:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:22,662 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 03:40:22,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:22,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414696255] [2022-11-03 03:40:22,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414696255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:22,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:22,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:40:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874089709] [2022-11-03 03:40:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:22,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:40:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:40:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:40:22,666 INFO L87 Difference]: Start difference. First operand 2835 states and 9287 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 03:40:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:22,855 INFO L93 Difference]: Finished difference Result 2262 states and 6724 transitions. [2022-11-03 03:40:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:40:22,856 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 03:40:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:22,864 INFO L225 Difference]: With dead ends: 2262 [2022-11-03 03:40:22,864 INFO L226 Difference]: Without dead ends: 1763 [2022-11-03 03:40:22,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:40:22,865 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 97 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:22,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 15 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-11-03 03:40:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1739. [2022-11-03 03:40:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 2.9223245109321057) internal successors, (5079), 1738 states have internal predecessors, (5079), 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 03:40:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5079 transitions. [2022-11-03 03:40:22,925 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5079 transitions. Word has length 17 [2022-11-03 03:40:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:22,926 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 5079 transitions. [2022-11-03 03:40:22,926 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 03:40:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5079 transitions. [2022-11-03 03:40:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 03:40:22,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:22,931 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 03:40:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:40:22,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2100299799, now seen corresponding path program 1 times [2022-11-03 03:40:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:22,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087956576] [2022-11-03 03:40:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:23,204 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 03:40:23,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:23,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087956576] [2022-11-03 03:40:23,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087956576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:23,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:23,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:40:23,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827869187] [2022-11-03 03:40:23,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:23,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:40:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:23,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:40:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:40:23,207 INFO L87 Difference]: Start difference. First operand 1739 states and 5079 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 03:40:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:23,427 INFO L93 Difference]: Finished difference Result 1468 states and 4244 transitions. [2022-11-03 03:40:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:40:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 03:40:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:23,433 INFO L225 Difference]: With dead ends: 1468 [2022-11-03 03:40:23,433 INFO L226 Difference]: Without dead ends: 1299 [2022-11-03 03:40:23,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:40:23,434 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 152 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:23,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 18 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2022-11-03 03:40:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1155. [2022-11-03 03:40:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 2.920277296360485) internal successors, (3370), 1154 states have internal predecessors, (3370), 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 03:40:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 3370 transitions. [2022-11-03 03:40:23,473 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 3370 transitions. Word has length 20 [2022-11-03 03:40:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:23,474 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 3370 transitions. [2022-11-03 03:40:23,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 03:40:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 3370 transitions. [2022-11-03 03:40:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:40:23,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:23,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:23,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:40:23,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2007212853, now seen corresponding path program 1 times [2022-11-03 03:40:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:23,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141644019] [2022-11-03 03:40:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:23,803 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 03:40:23,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:23,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141644019] [2022-11-03 03:40:23,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141644019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:23,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:23,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:40:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327778504] [2022-11-03 03:40:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:40:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:40:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:40:23,806 INFO L87 Difference]: Start difference. First operand 1155 states and 3370 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:24,012 INFO L93 Difference]: Finished difference Result 1106 states and 3272 transitions. [2022-11-03 03:40:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:40:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:40:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:24,015 INFO L225 Difference]: With dead ends: 1106 [2022-11-03 03:40:24,015 INFO L226 Difference]: Without dead ends: 735 [2022-11-03 03:40:24,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:40:24,016 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 176 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:24,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 13 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-03 03:40:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 573. [2022-11-03 03:40:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 2.937062937062937) internal successors, (1680), 572 states have internal predecessors, (1680), 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 03:40:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1680 transitions. [2022-11-03 03:40:24,031 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1680 transitions. Word has length 24 [2022-11-03 03:40:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:24,031 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1680 transitions. [2022-11-03 03:40:24,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:40:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1680 transitions. [2022-11-03 03:40:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:40:24,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:24,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:40:24,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -65603336, now seen corresponding path program 1 times [2022-11-03 03:40:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:24,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543096539] [2022-11-03 03:40:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:25,544 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 03:40:25,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:25,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543096539] [2022-11-03 03:40:25,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543096539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:25,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:25,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:40:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726698293] [2022-11-03 03:40:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:25,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:40:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:40:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:40:25,546 INFO L87 Difference]: Start difference. First operand 573 states and 1680 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 03:40:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:26,095 INFO L93 Difference]: Finished difference Result 906 states and 2662 transitions. [2022-11-03 03:40:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:40:26,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2022-11-03 03:40:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:26,098 INFO L225 Difference]: With dead ends: 906 [2022-11-03 03:40:26,098 INFO L226 Difference]: Without dead ends: 633 [2022-11-03 03:40:26,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:40:26,099 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:26,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 38 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:40:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-11-03 03:40:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 453. [2022-11-03 03:40:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 2.734513274336283) internal successors, (1236), 452 states have internal predecessors, (1236), 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 03:40:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1236 transitions. [2022-11-03 03:40:26,112 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1236 transitions. Word has length 28 [2022-11-03 03:40:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:26,112 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 1236 transitions. [2022-11-03 03:40:26,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 03:40:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1236 transitions. [2022-11-03 03:40:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:40:26,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:26,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:26,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:40:26,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1210738396, now seen corresponding path program 2 times [2022-11-03 03:40:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:26,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451181131] [2022-11-03 03:40:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:40:26,379 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 03:40:26,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:40:26,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451181131] [2022-11-03 03:40:26,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451181131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:40:26,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:40:26,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:40:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447229622] [2022-11-03 03:40:26,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:40:26,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:40:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:40:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:40:26,382 INFO L87 Difference]: Start difference. First operand 453 states and 1236 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 03:40:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:26,555 INFO L93 Difference]: Finished difference Result 558 states and 1496 transitions. [2022-11-03 03:40:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:40:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2022-11-03 03:40:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:26,557 INFO L225 Difference]: With dead ends: 558 [2022-11-03 03:40:26,557 INFO L226 Difference]: Without dead ends: 233 [2022-11-03 03:40:26,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:40:26,557 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:26,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 20 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:40:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-03 03:40:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-11-03 03:40:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.4310344827586206) internal successors, (564), 232 states have internal predecessors, (564), 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 03:40:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 564 transitions. [2022-11-03 03:40:26,563 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 564 transitions. Word has length 28 [2022-11-03 03:40:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:26,563 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 564 transitions. [2022-11-03 03:40:26,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 03:40:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 564 transitions. [2022-11-03 03:40:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:40:26,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:26,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:26,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:40:26,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 03:40:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash -586552556, now seen corresponding path program 3 times [2022-11-03 03:40:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818537631] [2022-11-03 03:40:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:40:26,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:40:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:40:26,831 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:40:26,831 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:40:26,832 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-03 03:40:26,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 03:40:26,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-03 03:40:26,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-03 03:40:26,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-03 03:40:26,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-03 03:40:26,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 03:40:26,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:40:26,841 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:26,846 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 03:40:26,846 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:40:26,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:40:26 BasicIcfg [2022-11-03 03:40:26,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:40:26,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:40:26,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:40:26,973 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:40:26,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:10" (3/4) ... [2022-11-03 03:40:26,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:40:27,106 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:40:27,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:40:27,107 INFO L158 Benchmark]: Toolchain (without parser) took 19091.24ms. Allocated memory was 115.3MB in the beginning and 562.0MB in the end (delta: 446.7MB). Free memory was 74.3MB in the beginning and 336.8MB in the end (delta: -262.4MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,107 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:40:27,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.25ms. Allocated memory is still 115.3MB. Free memory was 74.1MB in the beginning and 76.2MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.25ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 73.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,108 INFO L158 Benchmark]: Boogie Preprocessor took 71.61ms. Allocated memory is still 115.3MB. Free memory was 73.7MB in the beginning and 71.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,109 INFO L158 Benchmark]: RCFGBuilder took 1590.35ms. Allocated memory was 115.3MB in the beginning and 155.2MB in the end (delta: 39.8MB). Free memory was 71.1MB in the beginning and 101.0MB in the end (delta: -29.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,110 INFO L158 Benchmark]: TraceAbstraction took 16474.87ms. Allocated memory was 155.2MB in the beginning and 562.0MB in the end (delta: 406.8MB). Free memory was 101.0MB in the beginning and 359.8MB in the end (delta: -258.8MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,110 INFO L158 Benchmark]: Witness Printer took 133.24ms. Allocated memory is still 562.0MB. Free memory was 359.8MB in the beginning and 336.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-03 03:40:27,114 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.26ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.25ms. Allocated memory is still 115.3MB. Free memory was 74.1MB in the beginning and 76.2MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.25ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 73.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.61ms. Allocated memory is still 115.3MB. Free memory was 73.7MB in the beginning and 71.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1590.35ms. Allocated memory was 115.3MB in the beginning and 155.2MB in the end (delta: 39.8MB). Free memory was 71.1MB in the beginning and 101.0MB in the end (delta: -29.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16474.87ms. Allocated memory was 155.2MB in the beginning and 562.0MB in the end (delta: 406.8MB). Free memory was 101.0MB in the beginning and 359.8MB in the end (delta: -258.8MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. * Witness Printer took 133.24ms. Allocated memory is still 562.0MB. Free memory was 359.8MB in the beginning and 336.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 146 PlacesBefore, 47 PlacesAfterwards, 135 TransitionsBefore, 35 TransitionsAfterwards, 3290 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 8837 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4250, positive: 4036, positive conditional: 0, positive unconditional: 4036, negative: 214, negative conditional: 0, negative unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2343, positive: 2291, positive conditional: 0, positive unconditional: 2291, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2343, positive: 2267, positive conditional: 0, positive unconditional: 2267, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 651, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 600, negative conditional: 0, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4250, positive: 1745, positive conditional: 0, positive unconditional: 1745, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 2343, unknown conditional: 0, unknown unconditional: 2343] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=-1, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=0, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=1, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=2, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L818] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, weak$$choice2=0, x=2, y=2, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 807 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1331 IncrementalHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 68 mSDtfsCounter, 1331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4578occurred in iteration=2, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 2916 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 03:40:27,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a114c28-1230-4971-9118-877baeb57ad7/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