./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_tso.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_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/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 8faa67953d3c50165a030826612e1178eb11a833 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 12:31:01,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:31:01,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:31:01,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:31:01,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:31:01,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:31:01,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:31:01,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:31:01,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:31:01,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:31:01,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:31:01,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:31:01,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:31:01,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:31:01,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:31:01,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:31:01,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:31:01,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:31:01,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:31:01,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:31:01,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:31:01,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:31:01,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:31:01,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:31:01,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:31:01,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:31:01,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:31:01,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:31:01,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:31:01,594 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:31:01,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:31:01,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:31:01,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:31:01,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:31:01,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:31:01,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:31:01,596 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:31:01,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:31:01,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:31:01,607 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:31:01,608 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:31:01,608 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:31:01,609 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:31:01,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:31:01,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:31:01,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:31:01,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:31:01,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:31:01,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:31:01,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:31:01,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:31:01,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:31:01,611 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_1b919440-8a16-47b9-8e29-d9a2c215bf05/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 -> 8faa67953d3c50165a030826612e1178eb11a833 [2018-12-09 12:31:01,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:31:01,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:31:01,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:31:01,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:31:01,643 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:31:01,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix032_tso.opt_false-unreach-call.i [2018-12-09 12:31:01,678 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/data/674feb78a/b7067573406c46a6b82faf63d4078689/FLAG323925447 [2018-12-09 12:31:02,017 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:31:02,017 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/sv-benchmarks/c/pthread-wmm/mix032_tso.opt_false-unreach-call.i [2018-12-09 12:31:02,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/data/674feb78a/b7067573406c46a6b82faf63d4078689/FLAG323925447 [2018-12-09 12:31:02,411 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/data/674feb78a/b7067573406c46a6b82faf63d4078689 [2018-12-09 12:31:02,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:31:02,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:31:02,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:31:02,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:31:02,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:31:02,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02, skipping insertion in model container [2018-12-09 12:31:02,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:31:02,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:31:02,627 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:31:02,637 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:31:02,711 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:31:02,741 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:31:02,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02 WrapperNode [2018-12-09 12:31:02,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:31:02,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:31:02,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:31:02,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:31:02,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:31:02,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:31:02,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:31:02,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:31:02,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... [2018-12-09 12:31:02,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:31:02,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:31:02,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:31:02,790 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:31:02,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/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-09 12:31:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:31:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:31:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:31:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:31:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:31:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:31:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:31:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:31:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:31:02,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:31:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:31:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:31:02,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:31:02,824 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:31:03,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:31:03,113 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:31:03,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:03 BoogieIcfgContainer [2018-12-09 12:31:03,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:31:03,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:31:03,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:31:03,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:31:03,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:31:02" (1/3) ... [2018-12-09 12:31:03,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4955c949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:31:03, skipping insertion in model container [2018-12-09 12:31:03,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:31:02" (2/3) ... [2018-12-09 12:31:03,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4955c949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:31:03, skipping insertion in model container [2018-12-09 12:31:03,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:03" (3/3) ... [2018-12-09 12:31:03,118 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032_tso.opt_false-unreach-call.i [2018-12-09 12:31:03,139 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,140 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,150 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,151 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,152 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,153 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:31:03,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:31:03,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:31:03,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:31:03,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:31:03,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:31:03,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:31:03,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:31:03,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:31:03,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:31:03,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:31:03,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:31:03,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:31:03,193 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149places, 180 transitions [2018-12-09 12:31:22,786 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149048 states. [2018-12-09 12:31:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 149048 states. [2018-12-09 12:31:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:31:22,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:22,795 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] [2018-12-09 12:31:22,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:22,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1796074028, now seen corresponding path program 1 times [2018-12-09 12:31:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:22,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:22,946 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-09 12:31:22,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:22,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:31:22,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:22,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:31:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:31:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:31:22,961 INFO L87 Difference]: Start difference. First operand 149048 states. Second operand 4 states. [2018-12-09 12:31:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:25,573 INFO L93 Difference]: Finished difference Result 257068 states and 1188607 transitions. [2018-12-09 12:31:25,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:31:25,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 12:31:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:31:26,255 INFO L225 Difference]: With dead ends: 257068 [2018-12-09 12:31:26,255 INFO L226 Difference]: Without dead ends: 174818 [2018-12-09 12:31:26,256 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-09 12:31:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174818 states. [2018-12-09 12:31:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174818 to 110558. [2018-12-09 12:31:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-09 12:31:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511489 transitions. [2018-12-09 12:31:29,330 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511489 transitions. Word has length 49 [2018-12-09 12:31:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:31:29,331 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511489 transitions. [2018-12-09 12:31:29,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:31:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511489 transitions. [2018-12-09 12:31:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:31:29,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:29,343 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-09 12:31:29,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:29,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -506965212, now seen corresponding path program 1 times [2018-12-09 12:31:29,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:29,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:29,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:29,396 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-09 12:31:29,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:29,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:31:29,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:29,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:31:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:31:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:31:29,398 INFO L87 Difference]: Start difference. First operand 110558 states and 511489 transitions. Second operand 3 states. [2018-12-09 12:31:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:30,309 INFO L93 Difference]: Finished difference Result 110558 states and 511384 transitions. [2018-12-09 12:31:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:31:30,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-09 12:31:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:31:30,594 INFO L225 Difference]: With dead ends: 110558 [2018-12-09 12:31:30,594 INFO L226 Difference]: Without dead ends: 110558 [2018-12-09 12:31:30,595 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-09 12:31:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110558 states. [2018-12-09 12:31:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110558 to 110558. [2018-12-09 12:31:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-09 12:31:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511384 transitions. [2018-12-09 12:31:34,846 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511384 transitions. Word has length 57 [2018-12-09 12:31:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:31:34,846 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511384 transitions. [2018-12-09 12:31:34,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:31:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511384 transitions. [2018-12-09 12:31:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:31:34,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:34,853 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-09 12:31:34,854 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:34,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1235845123, now seen corresponding path program 1 times [2018-12-09 12:31:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:34,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:34,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:34,907 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-09 12:31:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:31:34,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:34,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:31:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:31:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:31:34,908 INFO L87 Difference]: Start difference. First operand 110558 states and 511384 transitions. Second operand 5 states. [2018-12-09 12:31:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:36,081 INFO L93 Difference]: Finished difference Result 240608 states and 1068639 transitions. [2018-12-09 12:31:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:31:36,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 12:31:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:31:36,715 INFO L225 Difference]: With dead ends: 240608 [2018-12-09 12:31:36,715 INFO L226 Difference]: Without dead ends: 237058 [2018-12-09 12:31:36,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:31:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237058 states. [2018-12-09 12:31:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237058 to 160438. [2018-12-09 12:31:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160438 states. [2018-12-09 12:31:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160438 states to 160438 states and 716828 transitions. [2018-12-09 12:31:40,686 INFO L78 Accepts]: Start accepts. Automaton has 160438 states and 716828 transitions. Word has length 57 [2018-12-09 12:31:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:31:40,686 INFO L480 AbstractCegarLoop]: Abstraction has 160438 states and 716828 transitions. [2018-12-09 12:31:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:31:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 160438 states and 716828 transitions. [2018-12-09 12:31:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:31:40,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:40,694 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] [2018-12-09 12:31:40,694 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:40,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1838099179, now seen corresponding path program 1 times [2018-12-09 12:31:40,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:40,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:40,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:40,778 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-09 12:31:40,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:40,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:31:40,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:40,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:31:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:31:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:31:40,779 INFO L87 Difference]: Start difference. First operand 160438 states and 716828 transitions. Second operand 6 states. [2018-12-09 12:31:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:41,919 INFO L93 Difference]: Finished difference Result 210258 states and 922769 transitions. [2018-12-09 12:31:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:31:41,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 12:31:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:31:42,466 INFO L225 Difference]: With dead ends: 210258 [2018-12-09 12:31:42,466 INFO L226 Difference]: Without dead ends: 207358 [2018-12-09 12:31:42,466 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-09 12:31:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207358 states. [2018-12-09 12:31:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207358 to 178278. [2018-12-09 12:31:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178278 states. [2018-12-09 12:31:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178278 states to 178278 states and 791365 transitions. [2018-12-09 12:31:48,300 INFO L78 Accepts]: Start accepts. Automaton has 178278 states and 791365 transitions. Word has length 58 [2018-12-09 12:31:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:31:48,300 INFO L480 AbstractCegarLoop]: Abstraction has 178278 states and 791365 transitions. [2018-12-09 12:31:48,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:31:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 178278 states and 791365 transitions. [2018-12-09 12:31:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 12:31:48,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:48,312 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] [2018-12-09 12:31:48,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:48,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -299178373, now seen corresponding path program 1 times [2018-12-09 12:31:48,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:48,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:48,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:48,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:48,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:48,341 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-09 12:31:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:31:48,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:48,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:31:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:31:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:31:48,342 INFO L87 Difference]: Start difference. First operand 178278 states and 791365 transitions. Second operand 3 states. [2018-12-09 12:31:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:49,384 INFO L93 Difference]: Finished difference Result 231658 states and 1011134 transitions. [2018-12-09 12:31:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:31:49,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 12:31:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:31:49,989 INFO L225 Difference]: With dead ends: 231658 [2018-12-09 12:31:49,989 INFO L226 Difference]: Without dead ends: 231658 [2018-12-09 12:31:49,990 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-09 12:31:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231658 states. [2018-12-09 12:31:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231658 to 202943. [2018-12-09 12:31:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202943 states. [2018-12-09 12:31:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202943 states to 202943 states and 893422 transitions. [2018-12-09 12:31:56,947 INFO L78 Accepts]: Start accepts. Automaton has 202943 states and 893422 transitions. Word has length 60 [2018-12-09 12:31:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:31:56,947 INFO L480 AbstractCegarLoop]: Abstraction has 202943 states and 893422 transitions. [2018-12-09 12:31:56,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:31:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 202943 states and 893422 transitions. [2018-12-09 12:31:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 12:31:56,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:31:56,980 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] [2018-12-09 12:31:56,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:31:56,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:31:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 281236806, now seen corresponding path program 1 times [2018-12-09 12:31:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:31:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:56,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:31:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:31:56,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:31:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:31:57,041 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-09 12:31:57,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:31:57,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:31:57,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:31:57,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:31:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:31:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:31:57,042 INFO L87 Difference]: Start difference. First operand 202943 states and 893422 transitions. Second operand 6 states. [2018-12-09 12:31:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:31:59,316 INFO L93 Difference]: Finished difference Result 356178 states and 1552140 transitions. [2018-12-09 12:31:59,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:31:59,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 12:31:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:00,190 INFO L225 Difference]: With dead ends: 356178 [2018-12-09 12:32:00,191 INFO L226 Difference]: Without dead ends: 352828 [2018-12-09 12:32:00,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:32:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352828 states. [2018-12-09 12:32:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352828 to 205748. [2018-12-09 12:32:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205748 states. [2018-12-09 12:32:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205748 states to 205748 states and 906656 transitions. [2018-12-09 12:32:08,769 INFO L78 Accepts]: Start accepts. Automaton has 205748 states and 906656 transitions. Word has length 64 [2018-12-09 12:32:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:08,769 INFO L480 AbstractCegarLoop]: Abstraction has 205748 states and 906656 transitions. [2018-12-09 12:32:08,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 205748 states and 906656 transitions. [2018-12-09 12:32:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 12:32:08,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:08,799 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] [2018-12-09 12:32:08,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1440890515, now seen corresponding path program 1 times [2018-12-09 12:32:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:08,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:08,873 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-09 12:32:08,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:08,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:08,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:08,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:08,874 INFO L87 Difference]: Start difference. First operand 205748 states and 906656 transitions. Second operand 6 states. [2018-12-09 12:32:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:10,361 INFO L93 Difference]: Finished difference Result 284253 states and 1239490 transitions. [2018-12-09 12:32:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:10,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 12:32:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:11,547 INFO L225 Difference]: With dead ends: 284253 [2018-12-09 12:32:11,548 INFO L226 Difference]: Without dead ends: 278558 [2018-12-09 12:32:11,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278558 states. [2018-12-09 12:32:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278558 to 261033. [2018-12-09 12:32:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261033 states. [2018-12-09 12:32:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261033 states to 261033 states and 1142709 transitions. [2018-12-09 12:32:16,814 INFO L78 Accepts]: Start accepts. Automaton has 261033 states and 1142709 transitions. Word has length 64 [2018-12-09 12:32:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:16,814 INFO L480 AbstractCegarLoop]: Abstraction has 261033 states and 1142709 transitions. [2018-12-09 12:32:16,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 261033 states and 1142709 transitions. [2018-12-09 12:32:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 12:32:16,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:16,853 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] [2018-12-09 12:32:16,854 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:16,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -356060844, now seen corresponding path program 1 times [2018-12-09 12:32:16,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:16,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:16,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:16,908 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-09 12:32:16,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:16,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:16,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:16,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:16,909 INFO L87 Difference]: Start difference. First operand 261033 states and 1142709 transitions. Second operand 7 states. [2018-12-09 12:32:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:19,248 INFO L93 Difference]: Finished difference Result 379448 states and 1607926 transitions. [2018-12-09 12:32:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:32:19,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-09 12:32:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:23,368 INFO L225 Difference]: With dead ends: 379448 [2018-12-09 12:32:23,369 INFO L226 Difference]: Without dead ends: 379448 [2018-12-09 12:32:23,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379448 states. [2018-12-09 12:32:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379448 to 308623. [2018-12-09 12:32:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308623 states. [2018-12-09 12:32:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308623 states to 308623 states and 1326666 transitions. [2018-12-09 12:32:29,888 INFO L78 Accepts]: Start accepts. Automaton has 308623 states and 1326666 transitions. Word has length 64 [2018-12-09 12:32:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:29,888 INFO L480 AbstractCegarLoop]: Abstraction has 308623 states and 1326666 transitions. [2018-12-09 12:32:29,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 308623 states and 1326666 transitions. [2018-12-09 12:32:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 12:32:29,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:29,925 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] [2018-12-09 12:32:29,925 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:29,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 531442837, now seen corresponding path program 1 times [2018-12-09 12:32:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:29,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:29,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:29,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:29,979 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-09 12:32:29,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:29,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:29,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:29,980 INFO L87 Difference]: Start difference. First operand 308623 states and 1326666 transitions. Second operand 4 states. [2018-12-09 12:32:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:31,565 INFO L93 Difference]: Finished difference Result 267156 states and 1127024 transitions. [2018-12-09 12:32:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:32:31,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 12:32:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:32,229 INFO L225 Difference]: With dead ends: 267156 [2018-12-09 12:32:32,229 INFO L226 Difference]: Without dead ends: 259071 [2018-12-09 12:32:32,230 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-09 12:32:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259071 states. [2018-12-09 12:32:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259071 to 259071. [2018-12-09 12:32:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259071 states. [2018-12-09 12:32:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259071 states to 259071 states and 1099302 transitions. [2018-12-09 12:32:37,612 INFO L78 Accepts]: Start accepts. Automaton has 259071 states and 1099302 transitions. Word has length 64 [2018-12-09 12:32:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:37,612 INFO L480 AbstractCegarLoop]: Abstraction has 259071 states and 1099302 transitions. [2018-12-09 12:32:37,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 259071 states and 1099302 transitions. [2018-12-09 12:32:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:32:37,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:37,648 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] [2018-12-09 12:32:37,648 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:37,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:37,649 INFO L82 PathProgramCache]: Analyzing trace with hash 757118313, now seen corresponding path program 1 times [2018-12-09 12:32:37,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:37,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:37,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:37,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:37,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:37,688 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-09 12:32:37,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:37,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:37,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:37,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:37,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:37,689 INFO L87 Difference]: Start difference. First operand 259071 states and 1099302 transitions. Second operand 3 states. [2018-12-09 12:32:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:38,573 INFO L93 Difference]: Finished difference Result 197447 states and 832000 transitions. [2018-12-09 12:32:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:38,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 12:32:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:39,060 INFO L225 Difference]: With dead ends: 197447 [2018-12-09 12:32:39,060 INFO L226 Difference]: Without dead ends: 195127 [2018-12-09 12:32:39,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195127 states. [2018-12-09 12:32:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195127 to 187352. [2018-12-09 12:32:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187352 states. [2018-12-09 12:32:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187352 states to 187352 states and 793027 transitions. [2018-12-09 12:32:45,015 INFO L78 Accepts]: Start accepts. Automaton has 187352 states and 793027 transitions. Word has length 65 [2018-12-09 12:32:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:45,015 INFO L480 AbstractCegarLoop]: Abstraction has 187352 states and 793027 transitions. [2018-12-09 12:32:45,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 187352 states and 793027 transitions. [2018-12-09 12:32:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 12:32:45,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:45,042 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] [2018-12-09 12:32:45,043 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:45,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash 214121039, now seen corresponding path program 1 times [2018-12-09 12:32:45,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:45,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:45,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:45,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:45,081 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-09 12:32:45,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:45,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:45,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:45,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:45,082 INFO L87 Difference]: Start difference. First operand 187352 states and 793027 transitions. Second operand 5 states. [2018-12-09 12:32:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:45,264 INFO L93 Difference]: Finished difference Result 43024 states and 165281 transitions. [2018-12-09 12:32:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:32:45,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 12:32:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:45,325 INFO L225 Difference]: With dead ends: 43024 [2018-12-09 12:32:45,325 INFO L226 Difference]: Without dead ends: 36624 [2018-12-09 12:32:45,326 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-09 12:32:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36624 states. [2018-12-09 12:32:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36624 to 36384. [2018-12-09 12:32:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36384 states. [2018-12-09 12:32:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36384 states to 36384 states and 138703 transitions. [2018-12-09 12:32:46,069 INFO L78 Accepts]: Start accepts. Automaton has 36384 states and 138703 transitions. Word has length 66 [2018-12-09 12:32:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:46,069 INFO L480 AbstractCegarLoop]: Abstraction has 36384 states and 138703 transitions. [2018-12-09 12:32:46,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 36384 states and 138703 transitions. [2018-12-09 12:32:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:32:46,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:46,080 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] [2018-12-09 12:32:46,080 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:46,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -229270171, now seen corresponding path program 1 times [2018-12-09 12:32:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:46,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:46,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-09 12:32:46,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:46,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:46,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:46,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:46,115 INFO L87 Difference]: Start difference. First operand 36384 states and 138703 transitions. Second operand 4 states. [2018-12-09 12:32:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:46,318 INFO L93 Difference]: Finished difference Result 43247 states and 163698 transitions. [2018-12-09 12:32:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:32:46,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 12:32:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:46,394 INFO L225 Difference]: With dead ends: 43247 [2018-12-09 12:32:46,395 INFO L226 Difference]: Without dead ends: 43247 [2018-12-09 12:32:46,395 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-09 12:32:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43247 states. [2018-12-09 12:32:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43247 to 39279. [2018-12-09 12:32:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39279 states. [2018-12-09 12:32:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39279 states to 39279 states and 149058 transitions. [2018-12-09 12:32:46,943 INFO L78 Accepts]: Start accepts. Automaton has 39279 states and 149058 transitions. Word has length 75 [2018-12-09 12:32:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:46,943 INFO L480 AbstractCegarLoop]: Abstraction has 39279 states and 149058 transitions. [2018-12-09 12:32:46,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 39279 states and 149058 transitions. [2018-12-09 12:32:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:32:46,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:46,956 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] [2018-12-09 12:32:46,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:46,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1513540164, now seen corresponding path program 1 times [2018-12-09 12:32:46,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:46,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:46,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:46,993 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-09 12:32:46,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:46,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:46,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:46,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:46,994 INFO L87 Difference]: Start difference. First operand 39279 states and 149058 transitions. Second operand 6 states. [2018-12-09 12:32:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:47,347 INFO L93 Difference]: Finished difference Result 68521 states and 259494 transitions. [2018-12-09 12:32:47,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:32:47,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-09 12:32:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:47,782 INFO L225 Difference]: With dead ends: 68521 [2018-12-09 12:32:47,782 INFO L226 Difference]: Without dead ends: 68201 [2018-12-09 12:32:47,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:32:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68201 states. [2018-12-09 12:32:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68201 to 43780. [2018-12-09 12:32:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43780 states. [2018-12-09 12:32:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43780 states to 43780 states and 165529 transitions. [2018-12-09 12:32:48,434 INFO L78 Accepts]: Start accepts. Automaton has 43780 states and 165529 transitions. Word has length 75 [2018-12-09 12:32:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:48,434 INFO L480 AbstractCegarLoop]: Abstraction has 43780 states and 165529 transitions. [2018-12-09 12:32:48,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43780 states and 165529 transitions. [2018-12-09 12:32:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:32:48,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:48,454 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] [2018-12-09 12:32:48,454 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:48,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 306991302, now seen corresponding path program 1 times [2018-12-09 12:32:48,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:48,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:48,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:48,495 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-09 12:32:48,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:48,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:48,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:48,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:48,496 INFO L87 Difference]: Start difference. First operand 43780 states and 165529 transitions. Second operand 4 states. [2018-12-09 12:32:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:48,769 INFO L93 Difference]: Finished difference Result 58448 states and 218723 transitions. [2018-12-09 12:32:48,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:48,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 12:32:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:48,870 INFO L225 Difference]: With dead ends: 58448 [2018-12-09 12:32:48,871 INFO L226 Difference]: Without dead ends: 58448 [2018-12-09 12:32:48,871 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-09 12:32:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58448 states. [2018-12-09 12:32:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58448 to 49263. [2018-12-09 12:32:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49263 states. [2018-12-09 12:32:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49263 states to 49263 states and 185105 transitions. [2018-12-09 12:32:49,703 INFO L78 Accepts]: Start accepts. Automaton has 49263 states and 185105 transitions. Word has length 79 [2018-12-09 12:32:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:49,703 INFO L480 AbstractCegarLoop]: Abstraction has 49263 states and 185105 transitions. [2018-12-09 12:32:49,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 49263 states and 185105 transitions. [2018-12-09 12:32:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:32:49,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:49,731 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] [2018-12-09 12:32:49,731 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:49,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1551755783, now seen corresponding path program 1 times [2018-12-09 12:32:49,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:49,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:49,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:49,777 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-09 12:32:49,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:49,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:49,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:49,778 INFO L87 Difference]: Start difference. First operand 49263 states and 185105 transitions. Second operand 6 states. [2018-12-09 12:32:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:50,403 INFO L93 Difference]: Finished difference Result 63582 states and 234998 transitions. [2018-12-09 12:32:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:50,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 12:32:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:50,516 INFO L225 Difference]: With dead ends: 63582 [2018-12-09 12:32:50,516 INFO L226 Difference]: Without dead ends: 63582 [2018-12-09 12:32:50,517 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-09 12:32:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63582 states. [2018-12-09 12:32:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63582 to 60255. [2018-12-09 12:32:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2018-12-09 12:32:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 223864 transitions. [2018-12-09 12:32:51,338 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 223864 transitions. Word has length 79 [2018-12-09 12:32:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:51,338 INFO L480 AbstractCegarLoop]: Abstraction has 60255 states and 223864 transitions. [2018-12-09 12:32:51,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 223864 transitions. [2018-12-09 12:32:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:32:51,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:51,372 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] [2018-12-09 12:32:51,372 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:51,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash -525453560, now seen corresponding path program 1 times [2018-12-09 12:32:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:51,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:51,433 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-09 12:32:51,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:51,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:51,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:51,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:51,434 INFO L87 Difference]: Start difference. First operand 60255 states and 223864 transitions. Second operand 6 states. [2018-12-09 12:32:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:51,888 INFO L93 Difference]: Finished difference Result 71613 states and 259343 transitions. [2018-12-09 12:32:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:51,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 12:32:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:52,006 INFO L225 Difference]: With dead ends: 71613 [2018-12-09 12:32:52,006 INFO L226 Difference]: Without dead ends: 71613 [2018-12-09 12:32:52,006 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-09 12:32:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71613 states. [2018-12-09 12:32:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71613 to 60175. [2018-12-09 12:32:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60175 states. [2018-12-09 12:32:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60175 states to 60175 states and 220231 transitions. [2018-12-09 12:32:52,842 INFO L78 Accepts]: Start accepts. Automaton has 60175 states and 220231 transitions. Word has length 79 [2018-12-09 12:32:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:52,843 INFO L480 AbstractCegarLoop]: Abstraction has 60175 states and 220231 transitions. [2018-12-09 12:32:52,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60175 states and 220231 transitions. [2018-12-09 12:32:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:32:52,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:52,876 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] [2018-12-09 12:32:52,876 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:52,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash -314102647, now seen corresponding path program 1 times [2018-12-09 12:32:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:52,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:52,939 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-09 12:32:52,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:52,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:32:52,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:52,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:32:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:32:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:32:52,940 INFO L87 Difference]: Start difference. First operand 60175 states and 220231 transitions. Second operand 5 states. [2018-12-09 12:32:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:53,298 INFO L93 Difference]: Finished difference Result 74006 states and 269515 transitions. [2018-12-09 12:32:53,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:53,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-09 12:32:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:53,422 INFO L225 Difference]: With dead ends: 74006 [2018-12-09 12:32:53,422 INFO L226 Difference]: Without dead ends: 74006 [2018-12-09 12:32:53,422 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-09 12:32:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74006 states. [2018-12-09 12:32:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74006 to 64638. [2018-12-09 12:32:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64638 states. [2018-12-09 12:32:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64638 states to 64638 states and 235071 transitions. [2018-12-09 12:32:54,388 INFO L78 Accepts]: Start accepts. Automaton has 64638 states and 235071 transitions. Word has length 79 [2018-12-09 12:32:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:54,388 INFO L480 AbstractCegarLoop]: Abstraction has 64638 states and 235071 transitions. [2018-12-09 12:32:54,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:32:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 64638 states and 235071 transitions. [2018-12-09 12:32:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 12:32:54,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:54,423 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] [2018-12-09 12:32:54,423 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:54,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -824636824, now seen corresponding path program 1 times [2018-12-09 12:32:54,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:54,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:54,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:54,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:54,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:54,467 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-09 12:32:54,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:54,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:32:54,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:32:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:32:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:32:54,468 INFO L87 Difference]: Start difference. First operand 64638 states and 235071 transitions. Second operand 6 states. [2018-12-09 12:32:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:54,559 INFO L93 Difference]: Finished difference Result 24718 states and 78455 transitions. [2018-12-09 12:32:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:54,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 12:32:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:54,584 INFO L225 Difference]: With dead ends: 24718 [2018-12-09 12:32:54,584 INFO L226 Difference]: Without dead ends: 20316 [2018-12-09 12:32:54,584 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-09 12:32:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20316 states. [2018-12-09 12:32:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20316 to 17481. [2018-12-09 12:32:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17481 states. [2018-12-09 12:32:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17481 states to 17481 states and 54783 transitions. [2018-12-09 12:32:54,769 INFO L78 Accepts]: Start accepts. Automaton has 17481 states and 54783 transitions. Word has length 79 [2018-12-09 12:32:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:54,769 INFO L480 AbstractCegarLoop]: Abstraction has 17481 states and 54783 transitions. [2018-12-09 12:32:54,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:32:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17481 states and 54783 transitions. [2018-12-09 12:32:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:54,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:54,784 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, 1] [2018-12-09 12:32:54,785 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:54,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2140816299, now seen corresponding path program 1 times [2018-12-09 12:32:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:54,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:54,847 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-09 12:32:54,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:54,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:54,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:54,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:54,848 INFO L87 Difference]: Start difference. First operand 17481 states and 54783 transitions. Second operand 7 states. [2018-12-09 12:32:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:55,204 INFO L93 Difference]: Finished difference Result 23284 states and 72651 transitions. [2018-12-09 12:32:55,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:32:55,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:32:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:55,228 INFO L225 Difference]: With dead ends: 23284 [2018-12-09 12:32:55,228 INFO L226 Difference]: Without dead ends: 23284 [2018-12-09 12:32:55,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2018-12-09 12:32:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 18231. [2018-12-09 12:32:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18231 states. [2018-12-09 12:32:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18231 states to 18231 states and 57333 transitions. [2018-12-09 12:32:55,437 INFO L78 Accepts]: Start accepts. Automaton has 18231 states and 57333 transitions. Word has length 96 [2018-12-09 12:32:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 18231 states and 57333 transitions. [2018-12-09 12:32:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18231 states and 57333 transitions. [2018-12-09 12:32:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:55,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:55,454 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, 1] [2018-12-09 12:32:55,454 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:55,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2006290962, now seen corresponding path program 1 times [2018-12-09 12:32:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:55,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:55,483 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-09 12:32:55,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:55,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:32:55,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:55,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:55,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:55,484 INFO L87 Difference]: Start difference. First operand 18231 states and 57333 transitions. Second operand 4 states. [2018-12-09 12:32:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:55,533 INFO L93 Difference]: Finished difference Result 18231 states and 57205 transitions. [2018-12-09 12:32:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:32:55,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 12:32:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:55,552 INFO L225 Difference]: With dead ends: 18231 [2018-12-09 12:32:55,552 INFO L226 Difference]: Without dead ends: 18231 [2018-12-09 12:32:55,553 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-09 12:32:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18231 states. [2018-12-09 12:32:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18231 to 15574. [2018-12-09 12:32:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15574 states. [2018-12-09 12:32:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15574 states to 15574 states and 48920 transitions. [2018-12-09 12:32:55,738 INFO L78 Accepts]: Start accepts. Automaton has 15574 states and 48920 transitions. Word has length 96 [2018-12-09 12:32:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:55,738 INFO L480 AbstractCegarLoop]: Abstraction has 15574 states and 48920 transitions. [2018-12-09 12:32:55,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15574 states and 48920 transitions. [2018-12-09 12:32:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:55,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:55,751 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, 1] [2018-12-09 12:32:55,751 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:55,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash -18809202, now seen corresponding path program 1 times [2018-12-09 12:32:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:55,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:55,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:55,827 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-09 12:32:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:32:55,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:55,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:32:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:32:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:55,828 INFO L87 Difference]: Start difference. First operand 15574 states and 48920 transitions. Second operand 8 states. [2018-12-09 12:32:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:56,051 INFO L93 Difference]: Finished difference Result 19471 states and 60430 transitions. [2018-12-09 12:32:56,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:32:56,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 12:32:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:56,071 INFO L225 Difference]: With dead ends: 19471 [2018-12-09 12:32:56,071 INFO L226 Difference]: Without dead ends: 19351 [2018-12-09 12:32:56,071 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-09 12:32:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19351 states. [2018-12-09 12:32:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19351 to 18317. [2018-12-09 12:32:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18317 states. [2018-12-09 12:32:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18317 states to 18317 states and 57195 transitions. [2018-12-09 12:32:56,262 INFO L78 Accepts]: Start accepts. Automaton has 18317 states and 57195 transitions. Word has length 96 [2018-12-09 12:32:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:56,262 INFO L480 AbstractCegarLoop]: Abstraction has 18317 states and 57195 transitions. [2018-12-09 12:32:56,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:32:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18317 states and 57195 transitions. [2018-12-09 12:32:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:56,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:56,277 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, 1] [2018-12-09 12:32:56,277 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:56,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash 868694479, now seen corresponding path program 1 times [2018-12-09 12:32:56,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:56,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:56,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:56,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:56,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:56,409 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-09 12:32:56,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:56,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:32:56,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:56,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:32:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:32:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:32:56,410 INFO L87 Difference]: Start difference. First operand 18317 states and 57195 transitions. Second operand 11 states. [2018-12-09 12:32:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:57,353 INFO L93 Difference]: Finished difference Result 31408 states and 97769 transitions. [2018-12-09 12:32:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:32:57,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 12:32:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:57,376 INFO L225 Difference]: With dead ends: 31408 [2018-12-09 12:32:57,377 INFO L226 Difference]: Without dead ends: 21812 [2018-12-09 12:32:57,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:32:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21812 states. [2018-12-09 12:32:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21812 to 18647. [2018-12-09 12:32:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18647 states. [2018-12-09 12:32:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 57939 transitions. [2018-12-09 12:32:57,569 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 57939 transitions. Word has length 96 [2018-12-09 12:32:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:57,570 INFO L480 AbstractCegarLoop]: Abstraction has 18647 states and 57939 transitions. [2018-12-09 12:32:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:32:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 57939 transitions. [2018-12-09 12:32:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:57,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:57,584 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, 1] [2018-12-09 12:32:57,585 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1477933554, now seen corresponding path program 1 times [2018-12-09 12:32:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:57,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:57,641 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-09 12:32:57,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:57,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:57,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:57,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:32:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:32:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:32:57,642 INFO L87 Difference]: Start difference. First operand 18647 states and 57939 transitions. Second operand 7 states. [2018-12-09 12:32:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,069 INFO L93 Difference]: Finished difference Result 26000 states and 79822 transitions. [2018-12-09 12:32:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:32:58,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 12:32:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,096 INFO L225 Difference]: With dead ends: 26000 [2018-12-09 12:32:58,096 INFO L226 Difference]: Without dead ends: 25320 [2018-12-09 12:32:58,096 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-09 12:32:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25320 states. [2018-12-09 12:32:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25320 to 19167. [2018-12-09 12:32:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19167 states. [2018-12-09 12:32:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19167 states to 19167 states and 58870 transitions. [2018-12-09 12:32:58,301 INFO L78 Accepts]: Start accepts. Automaton has 19167 states and 58870 transitions. Word has length 96 [2018-12-09 12:32:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 19167 states and 58870 transitions. [2018-12-09 12:32:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:32:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19167 states and 58870 transitions. [2018-12-09 12:32:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:58,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,316 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, 1] [2018-12-09 12:32:58,316 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:58,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash 739824399, now seen corresponding path program 2 times [2018-12-09 12:32:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,397 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-09 12:32:58,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:32:58,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:32:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:32:58,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:58,398 INFO L87 Difference]: Start difference. First operand 19167 states and 58870 transitions. Second operand 10 states. [2018-12-09 12:32:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,913 INFO L93 Difference]: Finished difference Result 35587 states and 108845 transitions. [2018-12-09 12:32:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:58,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 12:32:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,930 INFO L225 Difference]: With dead ends: 35587 [2018-12-09 12:32:58,930 INFO L226 Difference]: Without dead ends: 17179 [2018-12-09 12:32:58,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 12:32:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17179 states. [2018-12-09 12:32:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17179 to 17179. [2018-12-09 12:32:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17179 states. [2018-12-09 12:32:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 52498 transitions. [2018-12-09 12:32:59,091 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 52498 transitions. Word has length 96 [2018-12-09 12:32:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 17179 states and 52498 transitions. [2018-12-09 12:32:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:32:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 52498 transitions. [2018-12-09 12:32:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:59,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:59,105 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, 1] [2018-12-09 12:32:59,105 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:59,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash -5061991, now seen corresponding path program 3 times [2018-12-09 12:32:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:32:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:59,183 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-09 12:32:59,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:59,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:32:59,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:59,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:32:59,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:32:59,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:59,184 INFO L87 Difference]: Start difference. First operand 17179 states and 52498 transitions. Second operand 10 states. [2018-12-09 12:32:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:59,597 INFO L93 Difference]: Finished difference Result 30297 states and 92556 transitions. [2018-12-09 12:32:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:59,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 12:32:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:59,609 INFO L225 Difference]: With dead ends: 30297 [2018-12-09 12:32:59,609 INFO L226 Difference]: Without dead ends: 11301 [2018-12-09 12:32:59,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-09 12:32:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2018-12-09 12:32:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11301. [2018-12-09 12:32:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11301 states. [2018-12-09 12:32:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11301 states to 11301 states and 34527 transitions. [2018-12-09 12:32:59,707 INFO L78 Accepts]: Start accepts. Automaton has 11301 states and 34527 transitions. Word has length 96 [2018-12-09 12:32:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:59,707 INFO L480 AbstractCegarLoop]: Abstraction has 11301 states and 34527 transitions. [2018-12-09 12:32:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:32:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 11301 states and 34527 transitions. [2018-12-09 12:32:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 12:32:59,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:59,716 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, 1] [2018-12-09 12:32:59,716 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:32:59,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 272721815, now seen corresponding path program 4 times [2018-12-09 12:32:59,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:32:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:32:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:32:59,755 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:32:59,846 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:32:59,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:32:59 BasicIcfg [2018-12-09 12:32:59,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:32:59,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:32:59,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:32:59,848 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:32:59,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:31:03" (3/4) ... [2018-12-09 12:32:59,850 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:32:59,945 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1b919440-8a16-47b9-8e29-d9a2c215bf05/bin-2019/utaipan/witness.graphml [2018-12-09 12:32:59,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:32:59,946 INFO L168 Benchmark]: Toolchain (without parser) took 117532.45 ms. Allocated memory was 1.0 GB in the beginning and 9.1 GB in the end (delta: 8.1 GB). Free memory was 945.9 MB in the beginning and 5.5 GB in the end (delta: -4.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-09 12:32:59,947 INFO L168 Benchmark]: CDTParser took 0.12 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-09 12:32:59,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:59,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.04 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-09 12:32:59,948 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 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-09 12:32:59,948 INFO L168 Benchmark]: RCFGBuilder took 323.76 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:59,948 INFO L168 Benchmark]: TraceAbstraction took 116733.48 ms. Allocated memory was 1.1 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-09 12:32:59,948 INFO L168 Benchmark]: Witness Printer took 97.79 ms. Allocated memory is still 9.1 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:32:59,949 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.12 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 326.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.04 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 18.97 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 323.76 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116733.48 ms. Allocated memory was 1.1 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 97.79 ms. Allocated memory is still 9.1 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L686] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L808] -1 pthread_t t872; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L809] FCALL, FORK -1 pthread_create(&t872, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L810] -1 pthread_t t873; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L811] FCALL, FORK -1 pthread_create(&t873, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L812] -1 pthread_t t874; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L813] FCALL, FORK -1 pthread_create(&t874, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L765] 0 z$w_buff1 = z$w_buff0 [L766] 0 z$w_buff0 = 1 [L767] 0 z$w_buff1_used = z$w_buff0_used [L768] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L770] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L771] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L772] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L773] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L774] 0 z$r_buff0_thd3 = (_Bool)1 [L777] 0 a = 1 [L780] 0 __unbuffered_p2_EAX = a [L783] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L786] 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_p0_EAX=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] [L716] 1 b = 1 [L719] 1 __unbuffered_p0_EAX = x [L724] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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}, arg={0:0}, b=1, 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] [L731] 2 x = 1 [L734] 2 y = 1 [L737] 2 __unbuffered_p1_EAX = y [L740] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 2 z$flush_delayed = weak$$choice2 [L743] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L744] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L744] 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) [L745] 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_p0_EAX=0, __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=1, 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=1, 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] [L745] 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)) [L746] 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_p0_EAX=0, __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=1, 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=1, 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] [L746] 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)) [L747] 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_p0_EAX=0, __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=1, 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))=1, x=1, 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] [L747] 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)) [L748] 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_p0_EAX=0, __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=1, 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=1, 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] [L748] 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)) [L749] 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_p0_EAX=0, __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=1, 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=1, 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] [L749] 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)) [L750] 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_p0_EAX=0, __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=1, 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=1, 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] [L750] 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)) [L751] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L752] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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) [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 z = z$flush_delayed ? z$mem_tmp : z [L753] 2 z$flush_delayed = (_Bool)0 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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$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 [L789] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L789] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L790] 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 [L793] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L815] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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 = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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$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 [L822] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L822] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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] [L823] -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 [L826] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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_p0_EAX=0, __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=1, weak$$choice2=1, x=1, 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, 222 locations, 3 error locations. UNSAFE Result, 116.6s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 32.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7126 SDtfs, 9719 SDslu, 18496 SDs, 0 SdLazy, 7351 SolverSat, 373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308623occurred in iteration=8, 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: 62.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 524724 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1981 NumberOfCodeBlocks, 1981 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1860 ConstructedInterpolants, 0 QuantifiedInterpolants, 381487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...