./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:11:31,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:11:31,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:11:31,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:11:31,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:11:31,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:11:31,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:11:31,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:11:31,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:11:31,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:11:31,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:11:31,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:11:31,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:11:31,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:11:31,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:11:31,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:11:31,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:11:31,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:11:31,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:11:31,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:11:31,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:11:31,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:11:31,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:11:31,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:11:31,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:11:31,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:11:31,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:11:31,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:11:31,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:11:31,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:11:31,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:11:31,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:11:31,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:11:31,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:11:31,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:11:31,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:11:31,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:11:31,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:11:31,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:11:31,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:11:31,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:11:31,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 21:11:31,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:11:31,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:11:31,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:11:31,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:11:31,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:11:31,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:11:31,811 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:11:31,812 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:11:31,812 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:11:31,812 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:11:31,813 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:11:31,814 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:11:31,814 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:11:31,814 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:11:31,814 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:11:31,815 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:11:31,815 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:11:31,815 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:11:31,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:11:31,816 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:11:31,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:11:31,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:11:31,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:11:31,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:11:31,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:11:31,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:11:31,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:11:31,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:11:31,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:11:31,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:11:31,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:11:31,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:11:31,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:11:31,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:11:31,820 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:11:31,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:11:31,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:11:31,821 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:11:31,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:11:31,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:11:31,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:11:31,822 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_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 [2022-11-20 21:11:32,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:11:32,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:11:32,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:11:32,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:11:32,228 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:11:32,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-20 21:11:35,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:11:35,569 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:11:35,574 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-20 21:11:35,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/data/2136d4daa/5eca8542b46e4ca6b8c06244a2561e51/FLAG614a508b5 [2022-11-20 21:11:35,608 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/data/2136d4daa/5eca8542b46e4ca6b8c06244a2561e51 [2022-11-20 21:11:35,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:11:35,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:11:35,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:11:35,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:11:35,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:11:35,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:35" (1/1) ... [2022-11-20 21:11:35,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3512dbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:35, skipping insertion in model container [2022-11-20 21:11:35,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:11:35" (1/1) ... [2022-11-20 21:11:35,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:11:35,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:11:35,892 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-20 21:11:36,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:11:36,096 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:11:36,115 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-20 21:11:36,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:11:36,275 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:11:36,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36 WrapperNode [2022-11-20 21:11:36,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:11:36,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:11:36,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:11:36,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:11:36,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,355 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-20 21:11:36,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:11:36,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:11:36,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:11:36,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:11:36,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:11:36,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:11:36,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:11:36,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:11:36,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (1/1) ... [2022-11-20 21:11:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:11:36,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:11:36,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:11:36,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:11:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 21:11:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 21:11:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 21:11:36,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:11:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 21:11:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 21:11:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 21:11:36,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 21:11:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 21:11:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 21:11:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 21:11:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 21:11:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:11:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 21:11:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:11:36,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:11:36,576 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 21:11:36,850 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:11:36,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:11:37,521 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:11:37,932 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:11:37,933 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 21:11:37,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:37 BoogieIcfgContainer [2022-11-20 21:11:37,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:11:37,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:11:37,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:11:37,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:11:37,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:11:35" (1/3) ... [2022-11-20 21:11:37,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b93480d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:37, skipping insertion in model container [2022-11-20 21:11:37,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:11:36" (2/3) ... [2022-11-20 21:11:37,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b93480d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:11:37, skipping insertion in model container [2022-11-20 21:11:37,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:37" (3/3) ... [2022-11-20 21:11:37,946 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2022-11-20 21:11:37,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 21:11:37,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:11:37,968 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 21:11:37,968 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 21:11:38,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 21:11:38,100 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 21:11:38,123 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-20 21:11:38,128 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-20 21:11:38,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-11-20 21:11:38,187 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-20 21:11:38,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 21:11:38,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 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 56 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-20 21:11:38,195 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-11-20 21:11:49,685 INFO L134 LiptonReduction]: Checked pairs total: 6642 [2022-11-20 21:11:49,686 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-20 21:11:49,694 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-20 21:11:49,807 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:49,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:11:49,834 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;@7b01cf4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:11:49,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 21:11:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 21:11:49,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:49,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 21:11:49,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 26076606, now seen corresponding path program 1 times [2022-11-20 21:11:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:49,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890659609] [2022-11-20 21:11:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:50,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:50,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890659609] [2022-11-20 21:11:50,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890659609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:50,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:50,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 21:11:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785958109] [2022-11-20 21:11:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:11:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:11:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:11:50,445 INFO L87 Difference]: Start difference. First operand has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:50,678 INFO L93 Difference]: Finished difference Result 737 states and 2305 transitions. [2022-11-20 21:11:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:11:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-20 21:11:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:50,704 INFO L225 Difference]: With dead ends: 737 [2022-11-20 21:11:50,704 INFO L226 Difference]: Without dead ends: 687 [2022-11-20 21:11:50,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:11:50,709 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:50,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:11:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-11-20 21:11:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-20 21:11:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2022-11-20 21:11:50,812 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 4 [2022-11-20 21:11:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:50,813 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2022-11-20 21:11:50,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2022-11-20 21:11:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 21:11:50,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:50,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:50,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:11:50,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1634363419, now seen corresponding path program 1 times [2022-11-20 21:11:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:50,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146102924] [2022-11-20 21:11:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:51,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:51,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146102924] [2022-11-20 21:11:51,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146102924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:51,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:51,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:11:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201388144] [2022-11-20 21:11:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:11:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:11:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:11:51,251 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:51,449 INFO L93 Difference]: Finished difference Result 712 states and 2140 transitions. [2022-11-20 21:11:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:11:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 21:11:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:51,459 INFO L225 Difference]: With dead ends: 712 [2022-11-20 21:11:51,464 INFO L226 Difference]: Without dead ends: 587 [2022-11-20 21:11:51,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:11:51,467 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:51,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:11:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-20 21:11:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2022-11-20 21:11:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 3.054607508532423) internal successors, (1790), 586 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1790 transitions. [2022-11-20 21:11:51,557 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1790 transitions. Word has length 10 [2022-11-20 21:11:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:51,558 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 1790 transitions. [2022-11-20 21:11:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1790 transitions. [2022-11-20 21:11:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 21:11:51,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:51,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:51,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:11:51,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1335781215, now seen corresponding path program 1 times [2022-11-20 21:11:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:51,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443203312] [2022-11-20 21:11:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:51,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:51,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443203312] [2022-11-20 21:11:51,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443203312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:51,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:51,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:11:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004178518] [2022-11-20 21:11:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:51,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:11:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:11:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:11:51,897 INFO L87 Difference]: Start difference. First operand 587 states and 1790 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:52,070 INFO L93 Difference]: Finished difference Result 632 states and 1871 transitions. [2022-11-20 21:11:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:11:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 21:11:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:52,075 INFO L225 Difference]: With dead ends: 632 [2022-11-20 21:11:52,075 INFO L226 Difference]: Without dead ends: 557 [2022-11-20 21:11:52,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:11:52,077 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:52,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:11:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-11-20 21:11:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2022-11-20 21:11:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 3.0323741007194243) internal successors, (1686), 556 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1686 transitions. [2022-11-20 21:11:52,100 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1686 transitions. Word has length 12 [2022-11-20 21:11:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 1686 transitions. [2022-11-20 21:11:52,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1686 transitions. [2022-11-20 21:11:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 21:11:52,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:52,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:52,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 21:11:52,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1540426856, now seen corresponding path program 1 times [2022-11-20 21:11:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:52,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343822615] [2022-11-20 21:11:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:52,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343822615] [2022-11-20 21:11:52,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343822615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:52,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:52,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 21:11:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393716866] [2022-11-20 21:11:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:52,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:11:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:52,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:11:52,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:11:52,402 INFO L87 Difference]: Start difference. First operand 557 states and 1686 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-20 21:11:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:52,766 INFO L93 Difference]: Finished difference Result 1223 states and 3612 transitions. [2022-11-20 21:11:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 21:11:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-20 21:11:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:52,770 INFO L225 Difference]: With dead ends: 1223 [2022-11-20 21:11:52,771 INFO L226 Difference]: Without dead ends: 623 [2022-11-20 21:11:52,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:11:52,773 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 93 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:52,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 4 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:11:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-11-20 21:11:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 407. [2022-11-20 21:11:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 2.834975369458128) internal successors, (1151), 406 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1151 transitions. [2022-11-20 21:11:52,792 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1151 transitions. Word has length 13 [2022-11-20 21:11:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:52,794 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 1151 transitions. [2022-11-20 21:11:52,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-20 21:11:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1151 transitions. [2022-11-20 21:11:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 21:11:52,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:52,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:52,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 21:11:52,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 530641855, now seen corresponding path program 1 times [2022-11-20 21:11:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:52,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585085138] [2022-11-20 21:11:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:53,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:53,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585085138] [2022-11-20 21:11:53,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585085138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:53,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:11:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404685270] [2022-11-20 21:11:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:53,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:11:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:11:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:11:53,106 INFO L87 Difference]: Start difference. First operand 407 states and 1151 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:53,310 INFO L93 Difference]: Finished difference Result 614 states and 1715 transitions. [2022-11-20 21:11:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:11:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 21:11:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:53,313 INFO L225 Difference]: With dead ends: 614 [2022-11-20 21:11:53,314 INFO L226 Difference]: Without dead ends: 281 [2022-11-20 21:11:53,314 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-20 21:11:53,316 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:53,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:11:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-20 21:11:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-20 21:11:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.835714285714286) internal successors, (794), 280 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 794 transitions. [2022-11-20 21:11:53,330 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 794 transitions. Word has length 14 [2022-11-20 21:11:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:53,331 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 794 transitions. [2022-11-20 21:11:53,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 794 transitions. [2022-11-20 21:11:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 21:11:53,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:53,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 21:11:53,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -730002040, now seen corresponding path program 1 times [2022-11-20 21:11:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:53,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675810559] [2022-11-20 21:11:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:55,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:55,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675810559] [2022-11-20 21:11:55,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675810559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:55,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:55,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 21:11:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109590241] [2022-11-20 21:11:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:55,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 21:11:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:55,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 21:11:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 21:11:55,306 INFO L87 Difference]: Start difference. First operand 281 states and 794 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:55,651 INFO L93 Difference]: Finished difference Result 449 states and 1271 transitions. [2022-11-20 21:11:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:11:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 21:11:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:55,655 INFO L225 Difference]: With dead ends: 449 [2022-11-20 21:11:55,655 INFO L226 Difference]: Without dead ends: 405 [2022-11-20 21:11:55,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:11:55,656 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 77 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:55,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 8 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:11:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-11-20 21:11:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 381. [2022-11-20 21:11:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.836842105263158) internal successors, (1078), 380 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1078 transitions. [2022-11-20 21:11:55,673 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1078 transitions. Word has length 15 [2022-11-20 21:11:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:55,673 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 1078 transitions. [2022-11-20 21:11:55,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1078 transitions. [2022-11-20 21:11:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 21:11:55,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:55,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:55,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 21:11:55,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -383378580, now seen corresponding path program 2 times [2022-11-20 21:11:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312350081] [2022-11-20 21:11:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:57,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:57,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312350081] [2022-11-20 21:11:57,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312350081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:57,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:57,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 21:11:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2522395] [2022-11-20 21:11:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:57,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 21:11:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 21:11:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 21:11:57,021 INFO L87 Difference]: Start difference. First operand 381 states and 1078 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:57,506 INFO L93 Difference]: Finished difference Result 413 states and 1139 transitions. [2022-11-20 21:11:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:11:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 21:11:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:57,509 INFO L225 Difference]: With dead ends: 413 [2022-11-20 21:11:57,510 INFO L226 Difference]: Without dead ends: 377 [2022-11-20 21:11:57,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:11:57,511 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:57,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:11:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-20 21:11:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-11-20 21:11:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 2.823529411764706) internal successors, (1056), 374 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1056 transitions. [2022-11-20 21:11:57,528 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1056 transitions. Word has length 15 [2022-11-20 21:11:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:57,529 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 1056 transitions. [2022-11-20 21:11:57,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1056 transitions. [2022-11-20 21:11:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:11:57,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:57,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:57,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 21:11:57,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:11:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -780263986, now seen corresponding path program 1 times [2022-11-20 21:11:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:57,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670168637] [2022-11-20 21:11:57,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:59,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:59,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670168637] [2022-11-20 21:11:59,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670168637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:59,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:11:59,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 21:11:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384217778] [2022-11-20 21:11:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:59,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 21:11:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:59,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 21:11:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:11:59,666 INFO L87 Difference]: Start difference. First operand 375 states and 1056 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:00,147 INFO L93 Difference]: Finished difference Result 427 states and 1187 transitions. [2022-11-20 21:12:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:12:00,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:12:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:00,151 INFO L225 Difference]: With dead ends: 427 [2022-11-20 21:12:00,151 INFO L226 Difference]: Without dead ends: 391 [2022-11-20 21:12:00,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-20 21:12:00,152 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:00,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 8 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:12:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-20 21:12:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 271. [2022-11-20 21:12:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.774074074074074) internal successors, (749), 270 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 749 transitions. [2022-11-20 21:12:00,167 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 749 transitions. Word has length 16 [2022-11-20 21:12:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:00,167 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 749 transitions. [2022-11-20 21:12:00,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 749 transitions. [2022-11-20 21:12:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:12:00,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:00,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 21:12:00,170 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1455431721, now seen corresponding path program 1 times [2022-11-20 21:12:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:00,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256393935] [2022-11-20 21:12:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:03,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:03,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256393935] [2022-11-20 21:12:03,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256393935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:03,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:03,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 21:12:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271127736] [2022-11-20 21:12:03,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:03,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 21:12:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 21:12:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:12:03,009 INFO L87 Difference]: Start difference. First operand 271 states and 749 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:03,445 INFO L93 Difference]: Finished difference Result 321 states and 886 transitions. [2022-11-20 21:12:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:12:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 21:12:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:03,448 INFO L225 Difference]: With dead ends: 321 [2022-11-20 21:12:03,448 INFO L226 Difference]: Without dead ends: 303 [2022-11-20 21:12:03,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:12:03,450 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:03,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 22 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 21:12:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-20 21:12:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 279. [2022-11-20 21:12:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.7697841726618706) internal successors, (770), 278 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 770 transitions. [2022-11-20 21:12:03,464 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 770 transitions. Word has length 17 [2022-11-20 21:12:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:03,464 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 770 transitions. [2022-11-20 21:12:03,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 770 transitions. [2022-11-20 21:12:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:12:03,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:03,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 21:12:03,467 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1455445175, now seen corresponding path program 1 times [2022-11-20 21:12:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:03,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458533458] [2022-11-20 21:12:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:03,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:03,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458533458] [2022-11-20 21:12:03,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458533458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:03,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:03,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:12:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113423960] [2022-11-20 21:12:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:03,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:12:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:12:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:12:03,721 INFO L87 Difference]: Start difference. First operand 279 states and 770 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:03,882 INFO L93 Difference]: Finished difference Result 262 states and 637 transitions. [2022-11-20 21:12:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:12:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 21:12:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:03,884 INFO L225 Difference]: With dead ends: 262 [2022-11-20 21:12:03,884 INFO L226 Difference]: Without dead ends: 197 [2022-11-20 21:12:03,885 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-20 21:12:03,885 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:03,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 8 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:12:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-20 21:12:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-20 21:12:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.392857142857143) internal successors, (469), 196 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 469 transitions. [2022-11-20 21:12:03,894 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 469 transitions. Word has length 17 [2022-11-20 21:12:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:03,895 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 469 transitions. [2022-11-20 21:12:03,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 469 transitions. [2022-11-20 21:12:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 21:12:03,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:03,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:03,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 21:12:03,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1828898280, now seen corresponding path program 1 times [2022-11-20 21:12:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:03,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409591067] [2022-11-20 21:12:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:05,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409591067] [2022-11-20 21:12:05,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409591067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:05,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:05,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 21:12:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912471687] [2022-11-20 21:12:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 21:12:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 21:12:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:12:05,565 INFO L87 Difference]: Start difference. First operand 197 states and 469 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:05,951 INFO L93 Difference]: Finished difference Result 237 states and 558 transitions. [2022-11-20 21:12:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:12:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 21:12:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:05,954 INFO L225 Difference]: With dead ends: 237 [2022-11-20 21:12:05,955 INFO L226 Difference]: Without dead ends: 219 [2022-11-20 21:12:05,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:12:05,956 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:05,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:12:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-20 21:12:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-11-20 21:12:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.4292452830188678) internal successors, (515), 212 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 515 transitions. [2022-11-20 21:12:05,967 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 515 transitions. Word has length 18 [2022-11-20 21:12:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:05,994 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 515 transitions. [2022-11-20 21:12:05,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 515 transitions. [2022-11-20 21:12:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 21:12:05,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:05,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:05,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 21:12:05,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash -174437304, now seen corresponding path program 1 times [2022-11-20 21:12:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253524031] [2022-11-20 21:12:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:07,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253524031] [2022-11-20 21:12:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253524031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 21:12:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454410856] [2022-11-20 21:12:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:07,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 21:12:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 21:12:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:12:07,688 INFO L87 Difference]: Start difference. First operand 213 states and 515 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:08,031 INFO L93 Difference]: Finished difference Result 220 states and 522 transitions. [2022-11-20 21:12:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:12:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 21:12:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:08,033 INFO L225 Difference]: With dead ends: 220 [2022-11-20 21:12:08,034 INFO L226 Difference]: Without dead ends: 211 [2022-11-20 21:12:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:12:08,034 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:08,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:12:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-20 21:12:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-11-20 21:12:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.4174757281553396) internal successors, (498), 206 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 498 transitions. [2022-11-20 21:12:08,042 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 498 transitions. Word has length 18 [2022-11-20 21:12:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:08,042 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 498 transitions. [2022-11-20 21:12:08,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 498 transitions. [2022-11-20 21:12:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 21:12:08,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:08,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:08,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 21:12:08,044 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash -580786544, now seen corresponding path program 1 times [2022-11-20 21:12:08,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:08,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969049458] [2022-11-20 21:12:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:08,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969049458] [2022-11-20 21:12:08,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969049458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:08,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:08,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 21:12:08,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505709566] [2022-11-20 21:12:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:12:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:08,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:12:08,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 21:12:08,261 INFO L87 Difference]: Start difference. First operand 207 states and 498 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:08,420 INFO L93 Difference]: Finished difference Result 165 states and 350 transitions. [2022-11-20 21:12:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:12:08,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 21:12:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:08,422 INFO L225 Difference]: With dead ends: 165 [2022-11-20 21:12:08,422 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 21:12:08,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:12:08,423 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:08,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:12:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 21:12:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-11-20 21:12:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.016949152542373) internal successors, (238), 118 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 238 transitions. [2022-11-20 21:12:08,427 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 238 transitions. Word has length 18 [2022-11-20 21:12:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:08,428 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 238 transitions. [2022-11-20 21:12:08,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 238 transitions. [2022-11-20 21:12:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:12:08,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:08,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:08,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 21:12:08,429 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1236875482, now seen corresponding path program 1 times [2022-11-20 21:12:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:08,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539411773] [2022-11-20 21:12:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:10,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:10,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539411773] [2022-11-20 21:12:10,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539411773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:10,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 21:12:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709656180] [2022-11-20 21:12:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:10,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 21:12:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 21:12:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:12:10,928 INFO L87 Difference]: Start difference. First operand 119 states and 238 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:11,321 INFO L93 Difference]: Finished difference Result 134 states and 268 transitions. [2022-11-20 21:12:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:12:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:12:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:11,323 INFO L225 Difference]: With dead ends: 134 [2022-11-20 21:12:11,323 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 21:12:11,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-20 21:12:11,324 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:11,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 14 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:12:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 21:12:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2022-11-20 21:12:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.0327868852459017) internal successors, (248), 122 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 248 transitions. [2022-11-20 21:12:11,328 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 248 transitions. Word has length 20 [2022-11-20 21:12:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:11,328 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 248 transitions. [2022-11-20 21:12:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 248 transitions. [2022-11-20 21:12:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:12:11,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:11,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:11,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 21:12:11,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1643224722, now seen corresponding path program 1 times [2022-11-20 21:12:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:11,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777808567] [2022-11-20 21:12:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:11,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777808567] [2022-11-20 21:12:11,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777808567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:12:11,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:12:11,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:12:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200942067] [2022-11-20 21:12:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:12:11,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 21:12:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 21:12:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 21:12:11,595 INFO L87 Difference]: Start difference. First operand 123 states and 248 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-20 21:12:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:11,748 INFO L93 Difference]: Finished difference Result 102 states and 204 transitions. [2022-11-20 21:12:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:12:11,749 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-20 21:12:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:11,749 INFO L225 Difference]: With dead ends: 102 [2022-11-20 21:12:11,749 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 21:12:11,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:12:11,750 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:11,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:12:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 21:12:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2022-11-20 21:12:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.024390243902439) internal successors, (166), 82 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:12:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 166 transitions. [2022-11-20 21:12:11,753 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 166 transitions. Word has length 20 [2022-11-20 21:12:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:11,754 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 166 transitions. [2022-11-20 21:12:11,754 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-20 21:12:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 166 transitions. [2022-11-20 21:12:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 21:12:11,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:11,755 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] [2022-11-20 21:12:11,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 21:12:11,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 21:12:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 681603486, now seen corresponding path program 1 times [2022-11-20 21:12:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:11,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833619918] [2022-11-20 21:12:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:11,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 21:12:11,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 21:12:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 21:12:11,945 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 21:12:11,945 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 21:12:11,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 21:12:11,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 21:12:11,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 21:12:11,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 21:12:11,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 21:12:11,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 21:12:11,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 21:12:11,959 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:11,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 21:12:11,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 21:12:12,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:12:12 BasicIcfg [2022-11-20 21:12:12,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 21:12:12,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 21:12:12,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 21:12:12,107 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 21:12:12,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:11:37" (3/4) ... [2022-11-20 21:12:12,110 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 21:12:12,281 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 21:12:12,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 21:12:12,282 INFO L158 Benchmark]: Toolchain (without parser) took 36669.79ms. Allocated memory was 132.1MB in the beginning and 583.0MB in the end (delta: 450.9MB). Free memory was 85.1MB in the beginning and 300.3MB in the end (delta: -215.2MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,283 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 132.1MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 21:12:12,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 132.1MB. Free memory was 84.7MB in the beginning and 60.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.80ms. Allocated memory is still 132.1MB. Free memory was 60.4MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,285 INFO L158 Benchmark]: Boogie Preprocessor took 58.01ms. Allocated memory is still 132.1MB. Free memory was 57.8MB in the beginning and 55.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,286 INFO L158 Benchmark]: RCFGBuilder took 1520.50ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 55.8MB in the beginning and 143.8MB in the end (delta: -88.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,286 INFO L158 Benchmark]: TraceAbstraction took 34167.90ms. Allocated memory was 178.3MB in the beginning and 583.0MB in the end (delta: 404.8MB). Free memory was 142.8MB in the beginning and 319.3MB in the end (delta: -176.5MB). Peak memory consumption was 229.3MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,288 INFO L158 Benchmark]: Witness Printer took 175.25ms. Allocated memory is still 583.0MB. Free memory was 319.3MB in the beginning and 300.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 21:12:12,295 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.37ms. Allocated memory is still 132.1MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 132.1MB. Free memory was 84.7MB in the beginning and 60.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.80ms. Allocated memory is still 132.1MB. Free memory was 60.4MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.01ms. Allocated memory is still 132.1MB. Free memory was 57.8MB in the beginning and 55.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1520.50ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 55.8MB in the beginning and 143.8MB in the end (delta: -88.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34167.90ms. Allocated memory was 178.3MB in the beginning and 583.0MB in the end (delta: 404.8MB). Free memory was 142.8MB in the beginning and 319.3MB in the end (delta: -176.5MB). Peak memory consumption was 229.3MB. Max. memory is 16.1GB. * Witness Printer took 175.25ms. Allocated memory is still 583.0MB. Free memory was 319.3MB in the beginning and 300.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6s, 142 PlacesBefore, 37 PlacesAfterwards, 134 TransitionsBefore, 28 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 6642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2499, independent: 2253, independent conditional: 0, independent unconditional: 2253, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1432, independent: 1368, independent conditional: 0, independent unconditional: 1368, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1432, independent: 1352, independent conditional: 0, independent unconditional: 1352, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 927, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 891, dependent conditional: 0, dependent unconditional: 891, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2499, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1432, unknown conditional: 0, unknown unconditional: 1432] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=-1, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=0, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=1, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L760] 1 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, t1854={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 161 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1808 IncrementalHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 39 mSDtfsCounter, 1808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=899occurred in iteration=0, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 416 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 4576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 21:12:12,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4e461c0-1e15-4877-b35a-e4c2588a19c3/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE