./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5225c06c798b79433014bd7aed4e3fee4a02538 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:16:28,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:16:28,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:16:28,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:16:28,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:16:28,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:16:28,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:16:28,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:16:28,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:16:28,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:16:28,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:16:28,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:16:28,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:16:28,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:16:28,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:16:28,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:16:28,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:16:28,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:16:28,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:16:28,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:16:28,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:16:28,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:16:28,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:16:28,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:16:28,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:16:28,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:16:28,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:16:28,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:16:28,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:16:28,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:16:28,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:16:28,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:16:28,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:16:28,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:16:28,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:16:28,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:16:28,722 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:16:28,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:16:28,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:16:28,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:16:28,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:16:28,730 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:16:28,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:16:28,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:16:28,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:16:28,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:16:28,732 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:16:28,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:16:28,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:16:28,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:16:28,733 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan 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(__VERIFIER_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 -> c5225c06c798b79433014bd7aed4e3fee4a02538 [2018-12-02 04:16:28,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:16:28,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:16:28,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:16:28,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:16:28,759 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:16:28,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i [2018-12-02 04:16:28,795 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/data/437573fff/e8c35165d0b1477d946aa8a9bdcbd4cc/FLAG701c0b42d [2018-12-02 04:16:29,251 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:16:29,251 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/sv-benchmarks/c/pthread-wmm/mix033_pso.opt_false-unreach-call.i [2018-12-02 04:16:29,258 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/data/437573fff/e8c35165d0b1477d946aa8a9bdcbd4cc/FLAG701c0b42d [2018-12-02 04:16:29,266 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/data/437573fff/e8c35165d0b1477d946aa8a9bdcbd4cc [2018-12-02 04:16:29,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:16:29,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:16:29,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:16:29,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:16:29,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:16:29,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29, skipping insertion in model container [2018-12-02 04:16:29,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:16:29,304 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:16:29,495 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:16:29,503 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:16:29,575 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:16:29,620 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:16:29,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29 WrapperNode [2018-12-02 04:16:29,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:16:29,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:16:29,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:16:29,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:16:29,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:16:29,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:16:29,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:16:29,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:16:29,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... [2018-12-02 04:16:29,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:16:29,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:16:29,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:16:29,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:16:29,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 04:16:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 04:16:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 04:16:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 04:16:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 04:16:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 04:16:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 04:16:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:16:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:16:29,727 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 04:16:30,037 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:16:30,037 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 04:16:30,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:16:30 BoogieIcfgContainer [2018-12-02 04:16:30,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:16:30,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:16:30,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:16:30,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:16:30,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:16:29" (1/3) ... [2018-12-02 04:16:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4167727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:16:30, skipping insertion in model container [2018-12-02 04:16:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:16:29" (2/3) ... [2018-12-02 04:16:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4167727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:16:30, skipping insertion in model container [2018-12-02 04:16:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:16:30" (3/3) ... [2018-12-02 04:16:30,042 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt_false-unreach-call.i [2018-12-02 04:16:30,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,066 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:16:30,084 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 04:16:30,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:16:30,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 04:16:30,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 04:16:30,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:16:30,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:16:30,120 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:16:30,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:16:30,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:16:30,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:16:30,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:16:30,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:16:30,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148places, 179 transitions [2018-12-02 04:16:49,258 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149047 states. [2018-12-02 04:16:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 149047 states. [2018-12-02 04:16:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 04:16:49,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:16:49,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:16:49,269 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:16:49,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:16:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash -552567723, now seen corresponding path program 1 times [2018-12-02 04:16:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:16:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:16:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:16:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:16:49,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:16:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:16:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:16:49,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:16:49,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:16:49,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:16:49,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:16:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:16:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:16:49,432 INFO L87 Difference]: Start difference. First operand 149047 states. Second operand 4 states. [2018-12-02 04:16:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:16:50,860 INFO L93 Difference]: Finished difference Result 257067 states and 1188606 transitions. [2018-12-02 04:16:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:16:50,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-02 04:16:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:16:51,459 INFO L225 Difference]: With dead ends: 257067 [2018-12-02 04:16:51,459 INFO L226 Difference]: Without dead ends: 174817 [2018-12-02 04:16:51,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:16:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174817 states. [2018-12-02 04:16:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174817 to 110557. [2018-12-02 04:16:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-02 04:16:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511488 transitions. [2018-12-02 04:16:56,691 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511488 transitions. Word has length 48 [2018-12-02 04:16:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:16:56,692 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511488 transitions. [2018-12-02 04:16:56,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:16:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511488 transitions. [2018-12-02 04:16:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 04:16:56,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:16:56,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:16:56,702 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:16:56,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:16:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1274372901, now seen corresponding path program 1 times [2018-12-02 04:16:56,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:16:56,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:16:56,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:16:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:16:56,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:16:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:16:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:16:56,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:16:56,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:16:56,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:16:56,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:16:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:16:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:16:56,747 INFO L87 Difference]: Start difference. First operand 110557 states and 511488 transitions. Second operand 3 states. [2018-12-02 04:16:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:16:57,273 INFO L93 Difference]: Finished difference Result 110557 states and 511383 transitions. [2018-12-02 04:16:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:16:57,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-02 04:16:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:16:57,571 INFO L225 Difference]: With dead ends: 110557 [2018-12-02 04:16:57,571 INFO L226 Difference]: Without dead ends: 110557 [2018-12-02 04:16:57,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:16:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110557 states. [2018-12-02 04:16:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110557 to 110557. [2018-12-02 04:16:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-02 04:17:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511383 transitions. [2018-12-02 04:17:00,047 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511383 transitions. Word has length 56 [2018-12-02 04:17:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:00,047 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511383 transitions. [2018-12-02 04:17:00,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:17:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511383 transitions. [2018-12-02 04:17:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 04:17:00,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:00,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:00,055 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:00,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:00,055 INFO L82 PathProgramCache]: Analyzing trace with hash 468437434, now seen corresponding path program 1 times [2018-12-02 04:17:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:00,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:00,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:00,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:00,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:17:00,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:00,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:17:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:17:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:17:00,106 INFO L87 Difference]: Start difference. First operand 110557 states and 511383 transitions. Second operand 4 states. [2018-12-02 04:17:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:00,536 INFO L93 Difference]: Finished difference Result 99455 states and 448608 transitions. [2018-12-02 04:17:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:17:00,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 04:17:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:00,760 INFO L225 Difference]: With dead ends: 99455 [2018-12-02 04:17:00,760 INFO L226 Difference]: Without dead ends: 95225 [2018-12-02 04:17:00,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95225 states. [2018-12-02 04:17:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95225 to 95225. [2018-12-02 04:17:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95225 states. [2018-12-02 04:17:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95225 states to 95225 states and 432992 transitions. [2018-12-02 04:17:02,886 INFO L78 Accepts]: Start accepts. Automaton has 95225 states and 432992 transitions. Word has length 56 [2018-12-02 04:17:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:02,886 INFO L480 AbstractCegarLoop]: Abstraction has 95225 states and 432992 transitions. [2018-12-02 04:17:02,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:17:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 95225 states and 432992 transitions. [2018-12-02 04:17:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 04:17:02,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:02,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:02,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:02,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1865372316, now seen corresponding path program 1 times [2018-12-02 04:17:02,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:02,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:02,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:17:02,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:02,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:17:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:17:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:02,941 INFO L87 Difference]: Start difference. First operand 95225 states and 432992 transitions. Second operand 5 states. [2018-12-02 04:17:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:03,104 INFO L93 Difference]: Finished difference Result 30969 states and 124172 transitions. [2018-12-02 04:17:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:17:03,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-02 04:17:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:03,156 INFO L225 Difference]: With dead ends: 30969 [2018-12-02 04:17:03,157 INFO L226 Difference]: Without dead ends: 27341 [2018-12-02 04:17:03,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27341 states. [2018-12-02 04:17:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27341 to 26881. [2018-12-02 04:17:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26881 states. [2018-12-02 04:17:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26881 states to 26881 states and 107654 transitions. [2018-12-02 04:17:03,514 INFO L78 Accepts]: Start accepts. Automaton has 26881 states and 107654 transitions. Word has length 57 [2018-12-02 04:17:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:03,514 INFO L480 AbstractCegarLoop]: Abstraction has 26881 states and 107654 transitions. [2018-12-02 04:17:03,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:17:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26881 states and 107654 transitions. [2018-12-02 04:17:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 04:17:03,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:03,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:03,517 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:03,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1683293826, now seen corresponding path program 1 times [2018-12-02 04:17:03,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:03,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:03,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:03,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:03,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:03,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:03,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:03,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:03,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:03,577 INFO L87 Difference]: Start difference. First operand 26881 states and 107654 transitions. Second operand 6 states. [2018-12-02 04:17:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:03,880 INFO L93 Difference]: Finished difference Result 37433 states and 146191 transitions. [2018-12-02 04:17:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:17:03,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-02 04:17:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:03,945 INFO L225 Difference]: With dead ends: 37433 [2018-12-02 04:17:03,946 INFO L226 Difference]: Without dead ends: 37058 [2018-12-02 04:17:03,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:17:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37058 states. [2018-12-02 04:17:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37058 to 35274. [2018-12-02 04:17:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35274 states. [2018-12-02 04:17:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35274 states to 35274 states and 138749 transitions. [2018-12-02 04:17:04,435 INFO L78 Accepts]: Start accepts. Automaton has 35274 states and 138749 transitions. Word has length 57 [2018-12-02 04:17:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:04,436 INFO L480 AbstractCegarLoop]: Abstraction has 35274 states and 138749 transitions. [2018-12-02 04:17:04,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 35274 states and 138749 transitions. [2018-12-02 04:17:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 04:17:04,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:04,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:04,439 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:04,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash -674729880, now seen corresponding path program 1 times [2018-12-02 04:17:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:04,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:04,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:04,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:17:04,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:04,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:17:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:17:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:17:04,458 INFO L87 Difference]: Start difference. First operand 35274 states and 138749 transitions. Second operand 3 states. [2018-12-02 04:17:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:04,629 INFO L93 Difference]: Finished difference Result 46814 states and 182041 transitions. [2018-12-02 04:17:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:17:04,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-02 04:17:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:05,497 INFO L225 Difference]: With dead ends: 46814 [2018-12-02 04:17:05,497 INFO L226 Difference]: Without dead ends: 46794 [2018-12-02 04:17:05,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:17:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46794 states. [2018-12-02 04:17:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46794 to 36256. [2018-12-02 04:17:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36256 states. [2018-12-02 04:17:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36256 states to 36256 states and 141456 transitions. [2018-12-02 04:17:06,027 INFO L78 Accepts]: Start accepts. Automaton has 36256 states and 141456 transitions. Word has length 59 [2018-12-02 04:17:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:06,027 INFO L480 AbstractCegarLoop]: Abstraction has 36256 states and 141456 transitions. [2018-12-02 04:17:06,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:17:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36256 states and 141456 transitions. [2018-12-02 04:17:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 04:17:06,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:06,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:06,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:06,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:06,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2071932979, now seen corresponding path program 1 times [2018-12-02 04:17:06,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:06,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:06,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:06,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:06,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:06,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:06,086 INFO L87 Difference]: Start difference. First operand 36256 states and 141456 transitions. Second operand 6 states. [2018-12-02 04:17:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:06,454 INFO L93 Difference]: Finished difference Result 50348 states and 193878 transitions. [2018-12-02 04:17:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:17:06,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 04:17:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:06,549 INFO L225 Difference]: With dead ends: 50348 [2018-12-02 04:17:06,550 INFO L226 Difference]: Without dead ends: 49863 [2018-12-02 04:17:06,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:17:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49863 states. [2018-12-02 04:17:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49863 to 39290. [2018-12-02 04:17:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39290 states. [2018-12-02 04:17:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39290 states to 39290 states and 153277 transitions. [2018-12-02 04:17:07,148 INFO L78 Accepts]: Start accepts. Automaton has 39290 states and 153277 transitions. Word has length 63 [2018-12-02 04:17:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:07,148 INFO L480 AbstractCegarLoop]: Abstraction has 39290 states and 153277 transitions. [2018-12-02 04:17:07,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39290 states and 153277 transitions. [2018-12-02 04:17:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 04:17:07,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:07,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:07,163 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:07,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash -276513334, now seen corresponding path program 1 times [2018-12-02 04:17:07,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:07,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:07,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:07,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:07,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:07,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:07,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:17:07,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:07,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:17:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:17:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:17:07,207 INFO L87 Difference]: Start difference. First operand 39290 states and 153277 transitions. Second operand 4 states. [2018-12-02 04:17:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:07,440 INFO L93 Difference]: Finished difference Result 46153 states and 179280 transitions. [2018-12-02 04:17:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:17:07,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 04:17:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:07,524 INFO L225 Difference]: With dead ends: 46153 [2018-12-02 04:17:07,525 INFO L226 Difference]: Without dead ends: 46153 [2018-12-02 04:17:07,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46153 states. [2018-12-02 04:17:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46153 to 42185. [2018-12-02 04:17:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42185 states. [2018-12-02 04:17:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42185 states to 42185 states and 164112 transitions. [2018-12-02 04:17:08,107 INFO L78 Accepts]: Start accepts. Automaton has 42185 states and 164112 transitions. Word has length 74 [2018-12-02 04:17:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:08,107 INFO L480 AbstractCegarLoop]: Abstraction has 42185 states and 164112 transitions. [2018-12-02 04:17:08,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:17:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 42185 states and 164112 transitions. [2018-12-02 04:17:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 04:17:08,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:08,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:08,124 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:08,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1466297001, now seen corresponding path program 1 times [2018-12-02 04:17:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:08,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:08,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:08,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:08,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:08,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:08,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:08,177 INFO L87 Difference]: Start difference. First operand 42185 states and 164112 transitions. Second operand 6 states. [2018-12-02 04:17:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:08,816 INFO L93 Difference]: Finished difference Result 91408 states and 351791 transitions. [2018-12-02 04:17:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:17:08,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-02 04:17:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:08,987 INFO L225 Difference]: With dead ends: 91408 [2018-12-02 04:17:08,987 INFO L226 Difference]: Without dead ends: 91088 [2018-12-02 04:17:08,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:17:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91088 states. [2018-12-02 04:17:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91088 to 55498. [2018-12-02 04:17:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55498 states. [2018-12-02 04:17:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55498 states to 55498 states and 213500 transitions. [2018-12-02 04:17:09,978 INFO L78 Accepts]: Start accepts. Automaton has 55498 states and 213500 transitions. Word has length 74 [2018-12-02 04:17:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:09,978 INFO L480 AbstractCegarLoop]: Abstraction has 55498 states and 213500 transitions. [2018-12-02 04:17:09,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 55498 states and 213500 transitions. [2018-12-02 04:17:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 04:17:10,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:10,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:10,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:10,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1987377366, now seen corresponding path program 1 times [2018-12-02 04:17:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:10,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:10,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:10,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:17:10,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:10,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:17:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:17:10,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:17:10,056 INFO L87 Difference]: Start difference. First operand 55498 states and 213500 transitions. Second operand 4 states. [2018-12-02 04:17:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:10,418 INFO L93 Difference]: Finished difference Result 70629 states and 268392 transitions. [2018-12-02 04:17:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:17:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 04:17:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:10,551 INFO L225 Difference]: With dead ends: 70629 [2018-12-02 04:17:10,551 INFO L226 Difference]: Without dead ends: 70629 [2018-12-02 04:17:10,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:17:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70629 states. [2018-12-02 04:17:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70629 to 63993. [2018-12-02 04:17:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63993 states. [2018-12-02 04:17:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63993 states to 63993 states and 243820 transitions. [2018-12-02 04:17:11,471 INFO L78 Accepts]: Start accepts. Automaton has 63993 states and 243820 transitions. Word has length 76 [2018-12-02 04:17:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:11,471 INFO L480 AbstractCegarLoop]: Abstraction has 63993 states and 243820 transitions. [2018-12-02 04:17:11,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:17:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 63993 states and 243820 transitions. [2018-12-02 04:17:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 04:17:11,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:11,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:11,505 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:11,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash -89831977, now seen corresponding path program 1 times [2018-12-02 04:17:11,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:11,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:17:11,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:11,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:17:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:17:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:17:11,529 INFO L87 Difference]: Start difference. First operand 63993 states and 243820 transitions. Second operand 3 states. [2018-12-02 04:17:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:11,860 INFO L93 Difference]: Finished difference Result 66627 states and 253017 transitions. [2018-12-02 04:17:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:17:11,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-02 04:17:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:12,107 INFO L225 Difference]: With dead ends: 66627 [2018-12-02 04:17:12,107 INFO L226 Difference]: Without dead ends: 66627 [2018-12-02 04:17:12,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:17:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66627 states. [2018-12-02 04:17:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66627 to 65439. [2018-12-02 04:17:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65439 states. [2018-12-02 04:17:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65439 states to 65439 states and 248840 transitions. [2018-12-02 04:17:12,947 INFO L78 Accepts]: Start accepts. Automaton has 65439 states and 248840 transitions. Word has length 76 [2018-12-02 04:17:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:12,948 INFO L480 AbstractCegarLoop]: Abstraction has 65439 states and 248840 transitions. [2018-12-02 04:17:12,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:17:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 65439 states and 248840 transitions. [2018-12-02 04:17:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:17:12,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:12,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:12,988 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:12,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2086484495, now seen corresponding path program 1 times [2018-12-02 04:17:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:12,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:13,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:13,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:13,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:13,040 INFO L87 Difference]: Start difference. First operand 65439 states and 248840 transitions. Second operand 6 states. [2018-12-02 04:17:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:13,666 INFO L93 Difference]: Finished difference Result 79698 states and 299735 transitions. [2018-12-02 04:17:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:17:13,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 04:17:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:13,813 INFO L225 Difference]: With dead ends: 79698 [2018-12-02 04:17:13,813 INFO L226 Difference]: Without dead ends: 79698 [2018-12-02 04:17:13,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79698 states. [2018-12-02 04:17:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79698 to 75406. [2018-12-02 04:17:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75406 states. [2018-12-02 04:17:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75406 states to 75406 states and 284925 transitions. [2018-12-02 04:17:14,880 INFO L78 Accepts]: Start accepts. Automaton has 75406 states and 284925 transitions. Word has length 78 [2018-12-02 04:17:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:14,880 INFO L480 AbstractCegarLoop]: Abstraction has 75406 states and 284925 transitions. [2018-12-02 04:17:14,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 75406 states and 284925 transitions. [2018-12-02 04:17:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:17:14,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:14,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:14,928 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:14,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash 9275152, now seen corresponding path program 1 times [2018-12-02 04:17:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:14,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:14,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:14,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:14,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:14,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:14,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:14,984 INFO L87 Difference]: Start difference. First operand 75406 states and 284925 transitions. Second operand 6 states. [2018-12-02 04:17:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:15,484 INFO L93 Difference]: Finished difference Result 88588 states and 326142 transitions. [2018-12-02 04:17:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:17:15,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 04:17:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:15,801 INFO L225 Difference]: With dead ends: 88588 [2018-12-02 04:17:15,801 INFO L226 Difference]: Without dead ends: 88588 [2018-12-02 04:17:15,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:17:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88588 states. [2018-12-02 04:17:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88588 to 76931. [2018-12-02 04:17:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76931 states. [2018-12-02 04:17:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76931 states to 76931 states and 285924 transitions. [2018-12-02 04:17:16,828 INFO L78 Accepts]: Start accepts. Automaton has 76931 states and 285924 transitions. Word has length 78 [2018-12-02 04:17:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:16,828 INFO L480 AbstractCegarLoop]: Abstraction has 76931 states and 285924 transitions. [2018-12-02 04:17:16,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 76931 states and 285924 transitions. [2018-12-02 04:17:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:17:16,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:16,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:16,874 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:16,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 220626065, now seen corresponding path program 1 times [2018-12-02 04:17:16,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:16,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:16,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:16,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:17:16,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:16,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:17:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:17:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:16,944 INFO L87 Difference]: Start difference. First operand 76931 states and 285924 transitions. Second operand 5 states. [2018-12-02 04:17:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:17,399 INFO L93 Difference]: Finished difference Result 97024 states and 358812 transitions. [2018-12-02 04:17:17,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:17:17,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 04:17:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:17,579 INFO L225 Difference]: With dead ends: 97024 [2018-12-02 04:17:17,580 INFO L226 Difference]: Without dead ends: 97024 [2018-12-02 04:17:17,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97024 states. [2018-12-02 04:17:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97024 to 82886. [2018-12-02 04:17:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82886 states. [2018-12-02 04:17:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82886 states to 82886 states and 305942 transitions. [2018-12-02 04:17:18,792 INFO L78 Accepts]: Start accepts. Automaton has 82886 states and 305942 transitions. Word has length 78 [2018-12-02 04:17:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:18,792 INFO L480 AbstractCegarLoop]: Abstraction has 82886 states and 305942 transitions. [2018-12-02 04:17:18,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:17:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 82886 states and 305942 transitions. [2018-12-02 04:17:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:17:18,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:18,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:18,843 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:18,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash -289908112, now seen corresponding path program 1 times [2018-12-02 04:17:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:18,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:18,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:18,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:18,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:17:18,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:18,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:17:18,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:17:18,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:18,892 INFO L87 Difference]: Start difference. First operand 82886 states and 305942 transitions. Second operand 5 states. [2018-12-02 04:17:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:19,617 INFO L93 Difference]: Finished difference Result 112009 states and 412190 transitions. [2018-12-02 04:17:19,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:17:19,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 04:17:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:19,828 INFO L225 Difference]: With dead ends: 112009 [2018-12-02 04:17:19,828 INFO L226 Difference]: Without dead ends: 112009 [2018-12-02 04:17:19,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:17:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112009 states. [2018-12-02 04:17:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112009 to 87819. [2018-12-02 04:17:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87819 states. [2018-12-02 04:17:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87819 states to 87819 states and 324136 transitions. [2018-12-02 04:17:21,174 INFO L78 Accepts]: Start accepts. Automaton has 87819 states and 324136 transitions. Word has length 78 [2018-12-02 04:17:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:21,174 INFO L480 AbstractCegarLoop]: Abstraction has 87819 states and 324136 transitions. [2018-12-02 04:17:21,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:17:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 87819 states and 324136 transitions. [2018-12-02 04:17:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 04:17:21,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:21,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:21,225 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:21,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2097362575, now seen corresponding path program 1 times [2018-12-02 04:17:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:21,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:21,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:21,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:21,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:21,267 INFO L87 Difference]: Start difference. First operand 87819 states and 324136 transitions. Second operand 6 states. [2018-12-02 04:17:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:21,401 INFO L93 Difference]: Finished difference Result 31979 states and 101192 transitions. [2018-12-02 04:17:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:17:21,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 04:17:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:21,437 INFO L225 Difference]: With dead ends: 31979 [2018-12-02 04:17:21,437 INFO L226 Difference]: Without dead ends: 25698 [2018-12-02 04:17:21,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:17:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2018-12-02 04:17:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 22278. [2018-12-02 04:17:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22278 states. [2018-12-02 04:17:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22278 states to 22278 states and 69699 transitions. [2018-12-02 04:17:21,684 INFO L78 Accepts]: Start accepts. Automaton has 22278 states and 69699 transitions. Word has length 78 [2018-12-02 04:17:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:21,684 INFO L480 AbstractCegarLoop]: Abstraction has 22278 states and 69699 transitions. [2018-12-02 04:17:21,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22278 states and 69699 transitions. [2018-12-02 04:17:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 04:17:21,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:21,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:21,705 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:21,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1243988963, now seen corresponding path program 1 times [2018-12-02 04:17:21,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:21,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:21,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:21,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:21,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:21,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:21,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:17:21,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:21,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:17:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:17:21,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:21,784 INFO L87 Difference]: Start difference. First operand 22278 states and 69699 transitions. Second operand 7 states. [2018-12-02 04:17:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:22,162 INFO L93 Difference]: Finished difference Result 28056 states and 87492 transitions. [2018-12-02 04:17:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:17:22,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 04:17:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:22,196 INFO L225 Difference]: With dead ends: 28056 [2018-12-02 04:17:22,196 INFO L226 Difference]: Without dead ends: 28056 [2018-12-02 04:17:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28056 states. [2018-12-02 04:17:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28056 to 23028. [2018-12-02 04:17:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23028 states. [2018-12-02 04:17:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23028 states to 23028 states and 72249 transitions. [2018-12-02 04:17:22,468 INFO L78 Accepts]: Start accepts. Automaton has 23028 states and 72249 transitions. Word has length 93 [2018-12-02 04:17:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:22,468 INFO L480 AbstractCegarLoop]: Abstraction has 23028 states and 72249 transitions. [2018-12-02 04:17:22,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:17:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 23028 states and 72249 transitions. [2018-12-02 04:17:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 04:17:22,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:22,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:22,491 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:22,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:22,491 INFO L82 PathProgramCache]: Analyzing trace with hash 464240939, now seen corresponding path program 2 times [2018-12-02 04:17:22,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:22,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:22,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:22,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:17:22,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:22,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:17:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:17:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:17:22,541 INFO L87 Difference]: Start difference. First operand 23028 states and 72249 transitions. Second operand 5 states. [2018-12-02 04:17:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:22,730 INFO L93 Difference]: Finished difference Result 26662 states and 82783 transitions. [2018-12-02 04:17:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:17:22,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 04:17:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:22,761 INFO L225 Difference]: With dead ends: 26662 [2018-12-02 04:17:22,761 INFO L226 Difference]: Without dead ends: 26492 [2018-12-02 04:17:22,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:17:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26492 states. [2018-12-02 04:17:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26492 to 23808. [2018-12-02 04:17:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23808 states. [2018-12-02 04:17:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23808 states to 23808 states and 74413 transitions. [2018-12-02 04:17:23,021 INFO L78 Accepts]: Start accepts. Automaton has 23808 states and 74413 transitions. Word has length 93 [2018-12-02 04:17:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:23,021 INFO L480 AbstractCegarLoop]: Abstraction has 23808 states and 74413 transitions. [2018-12-02 04:17:23,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:17:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23808 states and 74413 transitions. [2018-12-02 04:17:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 04:17:23,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:23,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:23,045 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:23,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 240665687, now seen corresponding path program 3 times [2018-12-02 04:17:23,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:23,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:17:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:23,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:17:23,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:23,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:17:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:17:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:17:23,115 INFO L87 Difference]: Start difference. First operand 23808 states and 74413 transitions. Second operand 6 states. [2018-12-02 04:17:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:23,251 INFO L93 Difference]: Finished difference Result 23872 states and 74045 transitions. [2018-12-02 04:17:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:17:23,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 04:17:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:23,274 INFO L225 Difference]: With dead ends: 23872 [2018-12-02 04:17:23,274 INFO L226 Difference]: Without dead ends: 23872 [2018-12-02 04:17:23,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23872 states. [2018-12-02 04:17:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23872 to 16028. [2018-12-02 04:17:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16028 states. [2018-12-02 04:17:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16028 states to 16028 states and 50193 transitions. [2018-12-02 04:17:23,472 INFO L78 Accepts]: Start accepts. Automaton has 16028 states and 50193 transitions. Word has length 93 [2018-12-02 04:17:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:23,472 INFO L480 AbstractCegarLoop]: Abstraction has 16028 states and 50193 transitions. [2018-12-02 04:17:23,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:17:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16028 states and 50193 transitions. [2018-12-02 04:17:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:23,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:23,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:23,486 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:23,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1692142406, now seen corresponding path program 1 times [2018-12-02 04:17:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:23,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:17:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:23,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:23,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:17:23,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:23,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:17:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:17:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:23,541 INFO L87 Difference]: Start difference. First operand 16028 states and 50193 transitions. Second operand 7 states. [2018-12-02 04:17:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:23,878 INFO L93 Difference]: Finished difference Result 22140 states and 68568 transitions. [2018-12-02 04:17:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:17:23,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 04:17:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:23,901 INFO L225 Difference]: With dead ends: 22140 [2018-12-02 04:17:23,901 INFO L226 Difference]: Without dead ends: 21780 [2018-12-02 04:17:23,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:17:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2018-12-02 04:17:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 16498. [2018-12-02 04:17:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16498 states. [2018-12-02 04:17:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16498 states to 16498 states and 51199 transitions. [2018-12-02 04:17:24,087 INFO L78 Accepts]: Start accepts. Automaton has 16498 states and 51199 transitions. Word has length 95 [2018-12-02 04:17:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:24,087 INFO L480 AbstractCegarLoop]: Abstraction has 16498 states and 51199 transitions. [2018-12-02 04:17:24,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:17:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16498 states and 51199 transitions. [2018-12-02 04:17:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:24,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:24,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:24,102 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:24,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 525615547, now seen corresponding path program 1 times [2018-12-02 04:17:24,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:24,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:24,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:24,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:17:24,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:24,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:17:24,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:17:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:17:24,185 INFO L87 Difference]: Start difference. First operand 16498 states and 51199 transitions. Second operand 8 states. [2018-12-02 04:17:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:24,422 INFO L93 Difference]: Finished difference Result 19635 states and 60536 transitions. [2018-12-02 04:17:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:17:24,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-02 04:17:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:24,442 INFO L225 Difference]: With dead ends: 19635 [2018-12-02 04:17:24,442 INFO L226 Difference]: Without dead ends: 19635 [2018-12-02 04:17:24,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 04:17:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19635 states. [2018-12-02 04:17:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19635 to 18806. [2018-12-02 04:17:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18806 states. [2018-12-02 04:17:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18806 states to 18806 states and 58221 transitions. [2018-12-02 04:17:24,639 INFO L78 Accepts]: Start accepts. Automaton has 18806 states and 58221 transitions. Word has length 95 [2018-12-02 04:17:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:24,639 INFO L480 AbstractCegarLoop]: Abstraction has 18806 states and 58221 transitions. [2018-12-02 04:17:24,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:17:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 18806 states and 58221 transitions. [2018-12-02 04:17:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:24,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:24,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:24,656 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:24,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1413119228, now seen corresponding path program 1 times [2018-12-02 04:17:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:24,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:24,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:24,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:24,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 04:17:24,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:24,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:17:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:17:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:17:24,740 INFO L87 Difference]: Start difference. First operand 18806 states and 58221 transitions. Second operand 10 states. [2018-12-02 04:17:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:25,215 INFO L93 Difference]: Finished difference Result 35478 states and 109561 transitions. [2018-12-02 04:17:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:17:25,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-02 04:17:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:25,234 INFO L225 Difference]: With dead ends: 35478 [2018-12-02 04:17:25,234 INFO L226 Difference]: Without dead ends: 16946 [2018-12-02 04:17:25,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 04:17:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16946 states. [2018-12-02 04:17:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16946 to 16946. [2018-12-02 04:17:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16946 states. [2018-12-02 04:17:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16946 states to 16946 states and 52281 transitions. [2018-12-02 04:17:25,408 INFO L78 Accepts]: Start accepts. Automaton has 16946 states and 52281 transitions. Word has length 95 [2018-12-02 04:17:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:25,408 INFO L480 AbstractCegarLoop]: Abstraction has 16946 states and 52281 transitions. [2018-12-02 04:17:25,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:17:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16946 states and 52281 transitions. [2018-12-02 04:17:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:25,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:25,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:25,424 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:25,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash -996346436, now seen corresponding path program 2 times [2018-12-02 04:17:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:17:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:25,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:25,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:25,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:17:25,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:25,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:17:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:17:25,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:17:25,482 INFO L87 Difference]: Start difference. First operand 16946 states and 52281 transitions. Second operand 7 states. [2018-12-02 04:17:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:25,807 INFO L93 Difference]: Finished difference Result 28985 states and 89401 transitions. [2018-12-02 04:17:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:17:25,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 04:17:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:25,819 INFO L225 Difference]: With dead ends: 28985 [2018-12-02 04:17:25,819 INFO L226 Difference]: Without dead ends: 11158 [2018-12-02 04:17:25,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:17:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2018-12-02 04:17:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 11158. [2018-12-02 04:17:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11158 states. [2018-12-02 04:17:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11158 states to 11158 states and 34312 transitions. [2018-12-02 04:17:25,927 INFO L78 Accepts]: Start accepts. Automaton has 11158 states and 34312 transitions. Word has length 95 [2018-12-02 04:17:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:25,927 INFO L480 AbstractCegarLoop]: Abstraction has 11158 states and 34312 transitions. [2018-12-02 04:17:25,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:17:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 11158 states and 34312 transitions. [2018-12-02 04:17:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:25,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:25,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:25,938 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:25,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 701775706, now seen corresponding path program 3 times [2018-12-02 04:17:25,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:25,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:25,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:17:25,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:25,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:17:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:17:26,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:17:26,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 04:17:26,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:17:26,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 04:17:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 04:17:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:17:26,037 INFO L87 Difference]: Start difference. First operand 11158 states and 34312 transitions. Second operand 11 states. [2018-12-02 04:17:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:17:26,590 INFO L93 Difference]: Finished difference Result 19834 states and 61127 transitions. [2018-12-02 04:17:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:17:26,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 04:17:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:17:26,604 INFO L225 Difference]: With dead ends: 19834 [2018-12-02 04:17:26,604 INFO L226 Difference]: Without dead ends: 12852 [2018-12-02 04:17:26,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 04:17:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2018-12-02 04:17:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11300. [2018-12-02 04:17:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11300 states. [2018-12-02 04:17:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11300 states to 11300 states and 34526 transitions. [2018-12-02 04:17:26,714 INFO L78 Accepts]: Start accepts. Automaton has 11300 states and 34526 transitions. Word has length 95 [2018-12-02 04:17:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:17:26,714 INFO L480 AbstractCegarLoop]: Abstraction has 11300 states and 34526 transitions. [2018-12-02 04:17:26,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 04:17:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11300 states and 34526 transitions. [2018-12-02 04:17:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:17:26,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:17:26,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:17:26,724 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:17:26,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:17:26,724 INFO L82 PathProgramCache]: Analyzing trace with hash 452153496, now seen corresponding path program 4 times [2018-12-02 04:17:26,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:17:26,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:26,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:17:26,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:17:26,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:17:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:17:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:17:26,772 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:17:26,869 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 04:17:26,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:17:26 BasicIcfg [2018-12-02 04:17:26,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:17:26,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:17:26,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:17:26,871 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:17:26,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:16:30" (3/4) ... [2018-12-02 04:17:26,873 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 04:17:26,970 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e2ea43a4-cad3-4dcb-a7db-d4bcdccf0314/bin-2019/utaipan/witness.graphml [2018-12-02 04:17:26,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:17:26,971 INFO L168 Benchmark]: Toolchain (without parser) took 57703.58 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 947.0 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,972 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:17:26,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,973 INFO L168 Benchmark]: Boogie Preprocessor took 26.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:17:26,973 INFO L168 Benchmark]: RCFGBuilder took 347.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,974 INFO L168 Benchmark]: TraceAbstraction took 56832.50 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,974 INFO L168 Benchmark]: Witness Printer took 99.72 ms. Allocated memory is still 5.8 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:17:26,975 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56832.50 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 99.72 ms. Allocated memory is still 5.8 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L684] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] -1 pthread_t t884; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK -1 pthread_create(&t884, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] -1 pthread_t t885; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK -1 pthread_create(&t885, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] -1 pthread_t t886; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK -1 pthread_create(&t886, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 a = 1 [L778] 0 __unbuffered_p2_EAX = a [L781] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 b = 1 [L717] 1 x = 1 [L722] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L729] 2 x = 2 [L732] 2 y = 1 [L735] 2 __unbuffered_p1_EAX = y [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 221 locations, 3 error locations. UNSAFE Result, 56.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6764 SDtfs, 8736 SDslu, 15923 SDs, 0 SdLazy, 5745 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 65 SyntacticMatches, 18 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149047occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 215913 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1935 NumberOfCodeBlocks, 1935 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1816 ConstructedInterpolants, 0 QuantifiedInterpolants, 352061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...