./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_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_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/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 a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 19:03:03,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:03:03,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:03:03,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:03:03,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:03:03,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:03:03,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:03:03,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:03:03,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:03:03,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:03:03,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:03:03,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:03:03,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:03:03,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:03:03,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:03:03,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:03:03,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:03:03,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:03:03,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:03:03,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:03:03,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:03:03,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:03:03,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:03:03,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:03:03,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:03:03,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:03:03,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:03:03,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:03:03,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:03:03,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:03:03,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:03:03,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:03:03,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:03:03,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:03:03,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:03:03,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:03:03,811 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:03:03,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:03:03,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:03:03,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:03:03,818 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:03:03,818 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:03:03,818 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:03:03,818 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:03:03,818 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:03:03,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:03:03,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:03:03,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:03:03,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:03:03,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:03:03,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:03:03,821 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_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/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 -> a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 [2018-12-08 19:03:03,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:03:03,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:03:03,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:03:03,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:03:03,851 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:03:03,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-12-08 19:03:03,894 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/data/11535fbe4/3a72597409bf4aa3a62b33658877cc73/FLAG4a973cf04 [2018-12-08 19:03:04,318 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:03:04,318 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-12-08 19:03:04,327 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/data/11535fbe4/3a72597409bf4aa3a62b33658877cc73/FLAG4a973cf04 [2018-12-08 19:03:04,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/data/11535fbe4/3a72597409bf4aa3a62b33658877cc73 [2018-12-08 19:03:04,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:03:04,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:03:04,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:03:04,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:03:04,340 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:03:04,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10370d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04, skipping insertion in model container [2018-12-08 19:03:04,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:03:04,369 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:03:04,545 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:03:04,553 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:03:04,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:03:04,674 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:03:04,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04 WrapperNode [2018-12-08 19:03:04,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:03:04,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:03:04,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:03:04,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:03:04,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:03:04,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:03:04,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:03:04,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:03:04,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... [2018-12-08 19:03:04,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:03:04,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:03:04,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:03:04,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:03:04,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/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-08 19:03:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:03:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:03:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 19:03:04,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:03:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 19:03:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 19:03:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 19:03:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 19:03:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 19:03:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 19:03:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 19:03:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:03:04,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:03:04,774 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 19:03:05,065 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:03:05,065 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 19:03:05,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:03:05 BoogieIcfgContainer [2018-12-08 19:03:05,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:03:05,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:03:05,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:03:05,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:03:05,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:03:04" (1/3) ... [2018-12-08 19:03:05,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3ad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:03:05, skipping insertion in model container [2018-12-08 19:03:05,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:03:04" (2/3) ... [2018-12-08 19:03:05,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3ad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:03:05, skipping insertion in model container [2018-12-08 19:03:05,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:03:05" (3/3) ... [2018-12-08 19:03:05,070 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc_false-unreach-call.i [2018-12-08 19:03:05,092 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,093 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,094 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,095 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,098 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:03:05,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 19:03:05,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:03:05,114 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:03:05,124 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:03:05,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:03:05,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:03:05,140 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:03:05,140 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:03:05,140 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:03:05,140 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:03:05,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:03:05,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:03:05,149 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-08 19:03:19,166 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-08 19:03:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-08 19:03:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 19:03:19,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:19,175 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] [2018-12-08 19:03:19,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:19,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-08 19:03:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:19,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:19,338 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-08 19:03:19,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:19,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:03:19,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:19,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:03:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:03:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:03:19,352 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-08 19:03:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:03:20,547 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-08 19:03:20,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:03:20,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 19:03:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:03:21,286 INFO L225 Difference]: With dead ends: 233474 [2018-12-08 19:03:21,286 INFO L226 Difference]: Without dead ends: 203724 [2018-12-08 19:03:21,287 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-08 19:03:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-08 19:03:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-08 19:03:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-08 19:03:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-08 19:03:26,437 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-08 19:03:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:03:26,439 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-08 19:03:26,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:03:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-08 19:03:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 19:03:26,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:26,447 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] [2018-12-08 19:03:26,448 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:26,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-08 19:03:26,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:26,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:26,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:26,494 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-08 19:03:26,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:26,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:03:26,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:26,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:03:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:03:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:03:26,496 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-08 19:03:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:03:27,022 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-08 19:03:27,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:03:27,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 19:03:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:03:27,382 INFO L225 Difference]: With dead ends: 118894 [2018-12-08 19:03:27,382 INFO L226 Difference]: Without dead ends: 118894 [2018-12-08 19:03:27,383 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-08 19:03:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-08 19:03:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-08 19:03:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-08 19:03:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-08 19:03:32,429 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-08 19:03:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:03:32,429 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-08 19:03:32,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:03:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-08 19:03:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 19:03:32,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:32,432 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] [2018-12-08 19:03:32,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:32,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-08 19:03:32,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:32,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:32,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:32,496 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-08 19:03:32,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:32,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:03:32,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:32,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:03:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:03:32,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:03:32,497 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-08 19:03:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:03:34,132 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-08 19:03:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:03:34,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 19:03:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:03:35,034 INFO L225 Difference]: With dead ends: 325274 [2018-12-08 19:03:35,035 INFO L226 Difference]: Without dead ends: 324274 [2018-12-08 19:03:35,035 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-08 19:03:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-08 19:03:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-08 19:03:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-08 19:03:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-08 19:03:40,258 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-08 19:03:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:03:40,259 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-08 19:03:40,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:03:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-08 19:03:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 19:03:40,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:40,264 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] [2018-12-08 19:03:40,264 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:40,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-08 19:03:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:40,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:40,292 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-08 19:03:40,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:03:40,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:40,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:03:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:03:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:03:40,293 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 3 states. [2018-12-08 19:03:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:03:41,119 INFO L93 Difference]: Finished difference Result 186424 states and 840871 transitions. [2018-12-08 19:03:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:03:41,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-08 19:03:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:03:41,596 INFO L225 Difference]: With dead ends: 186424 [2018-12-08 19:03:41,597 INFO L226 Difference]: Without dead ends: 186424 [2018-12-08 19:03:41,597 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-08 19:03:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186424 states. [2018-12-08 19:03:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186424 to 186424. [2018-12-08 19:03:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-08 19:03:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840871 transitions. [2018-12-08 19:03:47,500 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840871 transitions. Word has length 53 [2018-12-08 19:03:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:03:47,500 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840871 transitions. [2018-12-08 19:03:47,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:03:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840871 transitions. [2018-12-08 19:03:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 19:03:47,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:47,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:03:47,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:47,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash -832854916, now seen corresponding path program 1 times [2018-12-08 19:03:47,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:47,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:47,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:47,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:47,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:47,539 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-08 19:03:47,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:47,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:03:47,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:47,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:03:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:03:47,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:03:47,540 INFO L87 Difference]: Start difference. First operand 186424 states and 840871 transitions. Second operand 5 states. [2018-12-08 19:03:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:03:49,432 INFO L93 Difference]: Finished difference Result 334054 states and 1500950 transitions. [2018-12-08 19:03:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:03:49,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 19:03:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:03:50,860 INFO L225 Difference]: With dead ends: 334054 [2018-12-08 19:03:50,860 INFO L226 Difference]: Without dead ends: 333004 [2018-12-08 19:03:50,860 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-08 19:03:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-12-08 19:03:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-12-08 19:03:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-08 19:03:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876429 transitions. [2018-12-08 19:03:58,567 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876429 transitions. Word has length 53 [2018-12-08 19:03:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:03:58,567 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876429 transitions. [2018-12-08 19:03:58,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:03:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876429 transitions. [2018-12-08 19:03:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 19:03:58,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:03:58,586 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-08 19:03:58,587 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:03:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:03:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 651985896, now seen corresponding path program 1 times [2018-12-08 19:03:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:03:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:58,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:03:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:03:58,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:03:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:03:58,637 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-08 19:03:58,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:03:58,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:03:58,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:03:58,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:03:58,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:03:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:03:58,638 INFO L87 Difference]: Start difference. First operand 194884 states and 876429 transitions. Second operand 6 states. [2018-12-08 19:04:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:00,864 INFO L93 Difference]: Finished difference Result 342294 states and 1509932 transitions. [2018-12-08 19:04:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 19:04:00,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-08 19:04:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:01,752 INFO L225 Difference]: With dead ends: 342294 [2018-12-08 19:04:01,752 INFO L226 Difference]: Without dead ends: 341294 [2018-12-08 19:04:01,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:04:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341294 states. [2018-12-08 19:04:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341294 to 189134. [2018-12-08 19:04:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189134 states. [2018-12-08 19:04:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189134 states to 189134 states and 850629 transitions. [2018-12-08 19:04:09,891 INFO L78 Accepts]: Start accepts. Automaton has 189134 states and 850629 transitions. Word has length 60 [2018-12-08 19:04:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:09,891 INFO L480 AbstractCegarLoop]: Abstraction has 189134 states and 850629 transitions. [2018-12-08 19:04:09,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:04:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 189134 states and 850629 transitions. [2018-12-08 19:04:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 19:04:09,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:09,960 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] [2018-12-08 19:04:09,960 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:09,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash -643326952, now seen corresponding path program 1 times [2018-12-08 19:04:09,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:10,018 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-08 19:04:10,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:10,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:04:10,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:10,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:04:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:04:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:04:10,019 INFO L87 Difference]: Start difference. First operand 189134 states and 850629 transitions. Second operand 6 states. [2018-12-08 19:04:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:12,384 INFO L93 Difference]: Finished difference Result 402824 states and 1786031 transitions. [2018-12-08 19:04:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 19:04:12,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 19:04:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:13,531 INFO L225 Difference]: With dead ends: 402824 [2018-12-08 19:04:13,531 INFO L226 Difference]: Without dead ends: 401224 [2018-12-08 19:04:13,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:04:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401224 states. [2018-12-08 19:04:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401224 to 224569. [2018-12-08 19:04:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224569 states. [2018-12-08 19:04:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224569 states to 224569 states and 1000347 transitions. [2018-12-08 19:04:19,832 INFO L78 Accepts]: Start accepts. Automaton has 224569 states and 1000347 transitions. Word has length 67 [2018-12-08 19:04:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:19,833 INFO L480 AbstractCegarLoop]: Abstraction has 224569 states and 1000347 transitions. [2018-12-08 19:04:19,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:04:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 224569 states and 1000347 transitions. [2018-12-08 19:04:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 19:04:19,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:19,927 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] [2018-12-08 19:04:19,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:19,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1444492136, now seen corresponding path program 1 times [2018-12-08 19:04:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:19,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:19,949 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-08 19:04:19,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:19,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:04:19,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:19,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:04:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:04:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:04:19,950 INFO L87 Difference]: Start difference. First operand 224569 states and 1000347 transitions. Second operand 3 states. [2018-12-08 19:04:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:23,199 INFO L93 Difference]: Finished difference Result 283189 states and 1243373 transitions. [2018-12-08 19:04:23,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:04:23,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 19:04:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:23,942 INFO L225 Difference]: With dead ends: 283189 [2018-12-08 19:04:23,942 INFO L226 Difference]: Without dead ends: 283189 [2018-12-08 19:04:23,943 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-08 19:04:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283189 states. [2018-12-08 19:04:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283189 to 245734. [2018-12-08 19:04:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245734 states. [2018-12-08 19:04:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245734 states to 245734 states and 1089139 transitions. [2018-12-08 19:04:29,333 INFO L78 Accepts]: Start accepts. Automaton has 245734 states and 1089139 transitions. Word has length 69 [2018-12-08 19:04:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:29,333 INFO L480 AbstractCegarLoop]: Abstraction has 245734 states and 1089139 transitions. [2018-12-08 19:04:29,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:04:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 245734 states and 1089139 transitions. [2018-12-08 19:04:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:04:29,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:29,476 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] [2018-12-08 19:04:29,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:29,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1764017531, now seen corresponding path program 1 times [2018-12-08 19:04:29,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:29,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:29,536 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-08 19:04:29,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:29,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:04:29,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:29,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:04:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:04:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:04:29,537 INFO L87 Difference]: Start difference. First operand 245734 states and 1089139 transitions. Second operand 4 states. [2018-12-08 19:04:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:31,675 INFO L93 Difference]: Finished difference Result 374149 states and 1647301 transitions. [2018-12-08 19:04:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:04:31,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-08 19:04:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:32,670 INFO L225 Difference]: With dead ends: 374149 [2018-12-08 19:04:32,670 INFO L226 Difference]: Without dead ends: 371924 [2018-12-08 19:04:32,670 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-08 19:04:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371924 states. [2018-12-08 19:04:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371924 to 310054. [2018-12-08 19:04:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310054 states. [2018-12-08 19:04:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310054 states to 310054 states and 1375940 transitions. [2018-12-08 19:04:43,170 INFO L78 Accepts]: Start accepts. Automaton has 310054 states and 1375940 transitions. Word has length 73 [2018-12-08 19:04:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:43,170 INFO L480 AbstractCegarLoop]: Abstraction has 310054 states and 1375940 transitions. [2018-12-08 19:04:43,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:04:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 310054 states and 1375940 transitions. [2018-12-08 19:04:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:04:43,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:43,386 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] [2018-12-08 19:04:43,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:43,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash -519253050, now seen corresponding path program 1 times [2018-12-08 19:04:43,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:43,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:43,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:43,489 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-08 19:04:43,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:43,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:04:43,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:43,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:04:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:04:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:04:43,490 INFO L87 Difference]: Start difference. First operand 310054 states and 1375940 transitions. Second operand 5 states. [2018-12-08 19:04:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:46,201 INFO L93 Difference]: Finished difference Result 485539 states and 2134528 transitions. [2018-12-08 19:04:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:04:46,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-08 19:04:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:48,089 INFO L225 Difference]: With dead ends: 485539 [2018-12-08 19:04:48,089 INFO L226 Difference]: Without dead ends: 484749 [2018-12-08 19:04:48,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:04:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484749 states. [2018-12-08 19:04:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484749 to 444414. [2018-12-08 19:04:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444414 states. [2018-12-08 19:05:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444414 states to 444414 states and 1962978 transitions. [2018-12-08 19:05:04,400 INFO L78 Accepts]: Start accepts. Automaton has 444414 states and 1962978 transitions. Word has length 73 [2018-12-08 19:05:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:05:04,400 INFO L480 AbstractCegarLoop]: Abstraction has 444414 states and 1962978 transitions. [2018-12-08 19:05:04,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:05:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 444414 states and 1962978 transitions. [2018-12-08 19:05:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 19:05:04,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:05:04,734 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] [2018-12-08 19:05:04,734 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:05:04,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:05:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1363724921, now seen corresponding path program 1 times [2018-12-08 19:05:04,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:05:04,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:04,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:05:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:04,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:05:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:05:04,782 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-08 19:05:04,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:05:04,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:05:04,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:05:04,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:05:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:05:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:05:04,783 INFO L87 Difference]: Start difference. First operand 444414 states and 1962978 transitions. Second operand 7 states. [2018-12-08 19:05:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:05:09,425 INFO L93 Difference]: Finished difference Result 778794 states and 3403142 transitions. [2018-12-08 19:05:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 19:05:09,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-08 19:05:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:05:11,677 INFO L225 Difference]: With dead ends: 778794 [2018-12-08 19:05:11,678 INFO L226 Difference]: Without dead ends: 777194 [2018-12-08 19:05:11,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-08 19:05:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777194 states. [2018-12-08 19:05:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777194 to 453624. [2018-12-08 19:05:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453624 states. [2018-12-08 19:05:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453624 states to 453624 states and 2000501 transitions. [2018-12-08 19:05:24,276 INFO L78 Accepts]: Start accepts. Automaton has 453624 states and 2000501 transitions. Word has length 73 [2018-12-08 19:05:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:05:24,276 INFO L480 AbstractCegarLoop]: Abstraction has 453624 states and 2000501 transitions. [2018-12-08 19:05:24,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:05:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 453624 states and 2000501 transitions. [2018-12-08 19:05:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 19:05:24,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:05:24,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:05:24,611 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:05:24,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:05:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1686899962, now seen corresponding path program 1 times [2018-12-08 19:05:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:05:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:05:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:24,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:05:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:05:24,654 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-08 19:05:24,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:05:24,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:05:24,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:05:24,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:05:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:05:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:05:24,655 INFO L87 Difference]: Start difference. First operand 453624 states and 2000501 transitions. Second operand 4 states. [2018-12-08 19:05:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:05:30,233 INFO L93 Difference]: Finished difference Result 400120 states and 1737408 transitions. [2018-12-08 19:05:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:05:30,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-08 19:05:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:05:31,715 INFO L225 Difference]: With dead ends: 400120 [2018-12-08 19:05:31,715 INFO L226 Difference]: Without dead ends: 397515 [2018-12-08 19:05:31,715 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-08 19:05:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397515 states. [2018-12-08 19:05:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397515 to 397515. [2018-12-08 19:05:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397515 states. [2018-12-08 19:05:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397515 states to 397515 states and 1728736 transitions. [2018-12-08 19:05:39,415 INFO L78 Accepts]: Start accepts. Automaton has 397515 states and 1728736 transitions. Word has length 74 [2018-12-08 19:05:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:05:39,415 INFO L480 AbstractCegarLoop]: Abstraction has 397515 states and 1728736 transitions. [2018-12-08 19:05:39,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:05:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 397515 states and 1728736 transitions. [2018-12-08 19:05:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 19:05:40,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:05:40,217 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-08 19:05:40,217 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:05:40,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:05:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash -756700490, now seen corresponding path program 1 times [2018-12-08 19:05:40,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:05:40,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:40,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:05:40,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:40,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:05:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:05:40,267 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-08 19:05:40,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:05:40,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:05:40,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:05:40,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:05:40,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:05:40,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:05:40,267 INFO L87 Difference]: Start difference. First operand 397515 states and 1728736 transitions. Second operand 7 states. [2018-12-08 19:05:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:05:43,612 INFO L93 Difference]: Finished difference Result 515847 states and 2230337 transitions. [2018-12-08 19:05:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 19:05:43,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-08 19:05:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:05:45,077 INFO L225 Difference]: With dead ends: 515847 [2018-12-08 19:05:45,077 INFO L226 Difference]: Without dead ends: 514687 [2018-12-08 19:05:45,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-08 19:05:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514687 states. [2018-12-08 19:05:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514687 to 400655. [2018-12-08 19:05:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400655 states. [2018-12-08 19:05:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400655 states to 400655 states and 1741263 transitions. [2018-12-08 19:05:59,266 INFO L78 Accepts]: Start accepts. Automaton has 400655 states and 1741263 transitions. Word has length 75 [2018-12-08 19:05:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:05:59,266 INFO L480 AbstractCegarLoop]: Abstraction has 400655 states and 1741263 transitions. [2018-12-08 19:05:59,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:05:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 400655 states and 1741263 transitions. [2018-12-08 19:05:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 19:05:59,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:05:59,663 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] [2018-12-08 19:05:59,663 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:05:59,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:05:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1674825725, now seen corresponding path program 1 times [2018-12-08 19:05:59,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:05:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:59,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:05:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:05:59,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:05:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:05:59,719 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-08 19:05:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:05:59,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:05:59,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:05:59,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:05:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:05:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:05:59,720 INFO L87 Difference]: Start difference. First operand 400655 states and 1741263 transitions. Second operand 6 states. [2018-12-08 19:06:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:03,106 INFO L93 Difference]: Finished difference Result 472323 states and 2037105 transitions. [2018-12-08 19:06:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:03,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 19:06:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:04,409 INFO L225 Difference]: With dead ends: 472323 [2018-12-08 19:06:04,409 INFO L226 Difference]: Without dead ends: 467531 [2018-12-08 19:06:04,409 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-08 19:06:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467531 states. [2018-12-08 19:06:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467531 to 396771. [2018-12-08 19:06:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396771 states. [2018-12-08 19:06:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396771 states to 396771 states and 1724829 transitions. [2018-12-08 19:06:13,404 INFO L78 Accepts]: Start accepts. Automaton has 396771 states and 1724829 transitions. Word has length 77 [2018-12-08 19:06:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:13,404 INFO L480 AbstractCegarLoop]: Abstraction has 396771 states and 1724829 transitions. [2018-12-08 19:06:13,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 396771 states and 1724829 transitions. [2018-12-08 19:06:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 19:06:13,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:13,793 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] [2018-12-08 19:06:13,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:13,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1957976189, now seen corresponding path program 1 times [2018-12-08 19:06:13,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:13,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:13,868 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-08 19:06:13,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:13,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:06:13,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:06:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:06:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:13,869 INFO L87 Difference]: Start difference. First operand 396771 states and 1724829 transitions. Second operand 7 states. [2018-12-08 19:06:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:19,662 INFO L93 Difference]: Finished difference Result 517291 states and 2209451 transitions. [2018-12-08 19:06:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 19:06:19,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-08 19:06:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:21,108 INFO L225 Difference]: With dead ends: 517291 [2018-12-08 19:06:21,108 INFO L226 Difference]: Without dead ends: 517291 [2018-12-08 19:06:21,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:06:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517291 states. [2018-12-08 19:06:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517291 to 479331. [2018-12-08 19:06:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479331 states. [2018-12-08 19:06:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479331 states to 479331 states and 2060157 transitions. [2018-12-08 19:06:31,384 INFO L78 Accepts]: Start accepts. Automaton has 479331 states and 2060157 transitions. Word has length 77 [2018-12-08 19:06:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:31,384 INFO L480 AbstractCegarLoop]: Abstraction has 479331 states and 2060157 transitions. [2018-12-08 19:06:31,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:06:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 479331 states and 2060157 transitions. [2018-12-08 19:06:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 19:06:32,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:32,502 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] [2018-12-08 19:06:32,502 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:32,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -713211708, now seen corresponding path program 1 times [2018-12-08 19:06:32,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:32,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:32,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:32,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:32,545 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-08 19:06:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:32,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:06:32,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:32,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:06:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:06:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:32,545 INFO L87 Difference]: Start difference. First operand 479331 states and 2060157 transitions. Second operand 5 states. [2018-12-08 19:06:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:33,130 INFO L93 Difference]: Finished difference Result 145491 states and 577373 transitions. [2018-12-08 19:06:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:06:33,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 19:06:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:33,451 INFO L225 Difference]: With dead ends: 145491 [2018-12-08 19:06:33,451 INFO L226 Difference]: Without dead ends: 143099 [2018-12-08 19:06:33,451 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-08 19:06:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143099 states. [2018-12-08 19:06:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143099 to 143039. [2018-12-08 19:06:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143039 states. [2018-12-08 19:06:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143039 states to 143039 states and 568209 transitions. [2018-12-08 19:06:35,823 INFO L78 Accepts]: Start accepts. Automaton has 143039 states and 568209 transitions. Word has length 77 [2018-12-08 19:06:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:35,823 INFO L480 AbstractCegarLoop]: Abstraction has 143039 states and 568209 transitions. [2018-12-08 19:06:35,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:06:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 143039 states and 568209 transitions. [2018-12-08 19:06:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 19:06:35,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:35,959 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] [2018-12-08 19:06:35,960 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:35,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash -101941788, now seen corresponding path program 1 times [2018-12-08 19:06:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:35,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:35,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:35,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-08 19:06:35,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:35,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:06:35,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:35,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:06:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:06:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:06:35,993 INFO L87 Difference]: Start difference. First operand 143039 states and 568209 transitions. Second operand 4 states. [2018-12-08 19:06:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:36,961 INFO L93 Difference]: Finished difference Result 180711 states and 711830 transitions. [2018-12-08 19:06:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:06:36,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-08 19:06:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:37,353 INFO L225 Difference]: With dead ends: 180711 [2018-12-08 19:06:37,353 INFO L226 Difference]: Without dead ends: 180711 [2018-12-08 19:06:37,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180711 states. [2018-12-08 19:06:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180711 to 148311. [2018-12-08 19:06:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148311 states. [2018-12-08 19:06:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148311 states to 148311 states and 587982 transitions. [2018-12-08 19:06:39,926 INFO L78 Accepts]: Start accepts. Automaton has 148311 states and 587982 transitions. Word has length 87 [2018-12-08 19:06:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:39,927 INFO L480 AbstractCegarLoop]: Abstraction has 148311 states and 587982 transitions. [2018-12-08 19:06:39,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:06:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 148311 states and 587982 transitions. [2018-12-08 19:06:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 19:06:40,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:40,070 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] [2018-12-08 19:06:40,071 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1732558019, now seen corresponding path program 1 times [2018-12-08 19:06:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:40,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:40,107 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-08 19:06:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:06:40,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:40,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:06:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:06:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:06:40,108 INFO L87 Difference]: Start difference. First operand 148311 states and 587982 transitions. Second operand 4 states. [2018-12-08 19:06:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:41,572 INFO L93 Difference]: Finished difference Result 203302 states and 797948 transitions. [2018-12-08 19:06:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:06:41,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-08 19:06:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:42,062 INFO L225 Difference]: With dead ends: 203302 [2018-12-08 19:06:42,062 INFO L226 Difference]: Without dead ends: 203302 [2018-12-08 19:06:42,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 19:06:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203302 states. [2018-12-08 19:06:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203302 to 184999. [2018-12-08 19:06:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184999 states. [2018-12-08 19:06:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184999 states to 184999 states and 729750 transitions. [2018-12-08 19:06:47,001 INFO L78 Accepts]: Start accepts. Automaton has 184999 states and 729750 transitions. Word has length 87 [2018-12-08 19:06:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:47,001 INFO L480 AbstractCegarLoop]: Abstraction has 184999 states and 729750 transitions. [2018-12-08 19:06:47,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:06:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 184999 states and 729750 transitions. [2018-12-08 19:06:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 19:06:47,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:47,193 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] [2018-12-08 19:06:47,193 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:47,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash -203102268, now seen corresponding path program 1 times [2018-12-08 19:06:47,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:47,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:47,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:47,250 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-08 19:06:47,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:47,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:47,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:47,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:47,250 INFO L87 Difference]: Start difference. First operand 184999 states and 729750 transitions. Second operand 6 states. [2018-12-08 19:06:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:47,335 INFO L93 Difference]: Finished difference Result 23095 states and 78958 transitions. [2018-12-08 19:06:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:06:47,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-08 19:06:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:47,361 INFO L225 Difference]: With dead ends: 23095 [2018-12-08 19:06:47,361 INFO L226 Difference]: Without dead ends: 21003 [2018-12-08 19:06:47,361 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-08 19:06:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-12-08 19:06:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 20468. [2018-12-08 19:06:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20468 states. [2018-12-08 19:06:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20468 states to 20468 states and 69983 transitions. [2018-12-08 19:06:47,582 INFO L78 Accepts]: Start accepts. Automaton has 20468 states and 69983 transitions. Word has length 87 [2018-12-08 19:06:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:47,582 INFO L480 AbstractCegarLoop]: Abstraction has 20468 states and 69983 transitions. [2018-12-08 19:06:47,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20468 states and 69983 transitions. [2018-12-08 19:06:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:06:47,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:47,600 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, 1, 1, 1, 1] [2018-12-08 19:06:47,600 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:47,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -899863943, now seen corresponding path program 1 times [2018-12-08 19:06:47,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:47,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:47,649 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-08 19:06:47,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:47,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:06:47,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:47,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:06:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:06:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:47,650 INFO L87 Difference]: Start difference. First operand 20468 states and 69983 transitions. Second operand 5 states. [2018-12-08 19:06:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:47,785 INFO L93 Difference]: Finished difference Result 22353 states and 75776 transitions. [2018-12-08 19:06:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:06:47,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 19:06:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:47,812 INFO L225 Difference]: With dead ends: 22353 [2018-12-08 19:06:47,812 INFO L226 Difference]: Without dead ends: 22353 [2018-12-08 19:06:47,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2018-12-08 19:06:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 20878. [2018-12-08 19:06:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20878 states. [2018-12-08 19:06:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20878 states to 20878 states and 71326 transitions. [2018-12-08 19:06:48,037 INFO L78 Accepts]: Start accepts. Automaton has 20878 states and 71326 transitions. Word has length 100 [2018-12-08 19:06:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:48,037 INFO L480 AbstractCegarLoop]: Abstraction has 20878 states and 71326 transitions. [2018-12-08 19:06:48,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:06:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20878 states and 71326 transitions. [2018-12-08 19:06:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:06:48,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:48,054 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, 1, 1, 1, 1] [2018-12-08 19:06:48,054 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1211886702, now seen corresponding path program 1 times [2018-12-08 19:06:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:48,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:48,096 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-08 19:06:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:48,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:06:48,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:48,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:06:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:06:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:06:48,097 INFO L87 Difference]: Start difference. First operand 20878 states and 71326 transitions. Second operand 4 states. [2018-12-08 19:06:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:48,218 INFO L93 Difference]: Finished difference Result 23729 states and 80154 transitions. [2018-12-08 19:06:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:06:48,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 19:06:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:48,246 INFO L225 Difference]: With dead ends: 23729 [2018-12-08 19:06:48,246 INFO L226 Difference]: Without dead ends: 23589 [2018-12-08 19:06:48,246 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-08 19:06:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23589 states. [2018-12-08 19:06:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23589 to 23256. [2018-12-08 19:06:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23256 states. [2018-12-08 19:06:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23256 states to 23256 states and 78787 transitions. [2018-12-08 19:06:48,491 INFO L78 Accepts]: Start accepts. Automaton has 23256 states and 78787 transitions. Word has length 100 [2018-12-08 19:06:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:48,492 INFO L480 AbstractCegarLoop]: Abstraction has 23256 states and 78787 transitions. [2018-12-08 19:06:48,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:06:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 23256 states and 78787 transitions. [2018-12-08 19:06:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:06:48,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:48,781 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, 1, 1, 1, 1] [2018-12-08 19:06:48,781 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:48,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash -242305679, now seen corresponding path program 1 times [2018-12-08 19:06:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:48,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:48,808 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-08 19:06:48,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:48,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:06:48,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:48,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:06:48,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:06:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:06:48,809 INFO L87 Difference]: Start difference. First operand 23256 states and 78787 transitions. Second operand 4 states. [2018-12-08 19:06:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:48,998 INFO L93 Difference]: Finished difference Result 28856 states and 98170 transitions. [2018-12-08 19:06:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:06:48,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 19:06:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:49,037 INFO L225 Difference]: With dead ends: 28856 [2018-12-08 19:06:49,037 INFO L226 Difference]: Without dead ends: 28856 [2018-12-08 19:06:49,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:06:49,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2018-12-08 19:06:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 22521. [2018-12-08 19:06:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22521 states. [2018-12-08 19:06:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22521 states to 22521 states and 76129 transitions. [2018-12-08 19:06:49,317 INFO L78 Accepts]: Start accepts. Automaton has 22521 states and 76129 transitions. Word has length 100 [2018-12-08 19:06:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:49,318 INFO L480 AbstractCegarLoop]: Abstraction has 22521 states and 76129 transitions. [2018-12-08 19:06:49,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:06:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22521 states and 76129 transitions. [2018-12-08 19:06:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 19:06:49,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:49,336 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, 1, 1, 1, 1] [2018-12-08 19:06:49,336 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:49,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash -978148605, now seen corresponding path program 2 times [2018-12-08 19:06:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:49,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:49,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:49,371 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-08 19:06:49,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:49,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:06:49,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:49,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:06:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:06:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:49,371 INFO L87 Difference]: Start difference. First operand 22521 states and 76129 transitions. Second operand 5 states. [2018-12-08 19:06:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:49,543 INFO L93 Difference]: Finished difference Result 24497 states and 82257 transitions. [2018-12-08 19:06:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:49,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 19:06:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:49,571 INFO L225 Difference]: With dead ends: 24497 [2018-12-08 19:06:49,571 INFO L226 Difference]: Without dead ends: 24357 [2018-12-08 19:06:49,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:06:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24357 states. [2018-12-08 19:06:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24357 to 22151. [2018-12-08 19:06:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22151 states. [2018-12-08 19:06:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22151 states to 22151 states and 74898 transitions. [2018-12-08 19:06:49,795 INFO L78 Accepts]: Start accepts. Automaton has 22151 states and 74898 transitions. Word has length 100 [2018-12-08 19:06:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:49,795 INFO L480 AbstractCegarLoop]: Abstraction has 22151 states and 74898 transitions. [2018-12-08 19:06:49,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:06:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 22151 states and 74898 transitions. [2018-12-08 19:06:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:06:49,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:49,813 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, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:49,813 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:49,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1242911627, now seen corresponding path program 1 times [2018-12-08 19:06:49,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:49,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:49,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:06:49,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:49,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:49,857 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-08 19:06:49,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:49,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:49,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:49,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:49,858 INFO L87 Difference]: Start difference. First operand 22151 states and 74898 transitions. Second operand 6 states. [2018-12-08 19:06:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:50,123 INFO L93 Difference]: Finished difference Result 24026 states and 80153 transitions. [2018-12-08 19:06:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:06:50,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 19:06:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:50,151 INFO L225 Difference]: With dead ends: 24026 [2018-12-08 19:06:50,151 INFO L226 Difference]: Without dead ends: 23451 [2018-12-08 19:06:50,151 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-08 19:06:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23451 states. [2018-12-08 19:06:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23451 to 22976. [2018-12-08 19:06:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22976 states. [2018-12-08 19:06:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22976 states to 22976 states and 77268 transitions. [2018-12-08 19:06:50,393 INFO L78 Accepts]: Start accepts. Automaton has 22976 states and 77268 transitions. Word has length 102 [2018-12-08 19:06:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 22976 states and 77268 transitions. [2018-12-08 19:06:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 22976 states and 77268 transitions. [2018-12-08 19:06:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:06:50,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:50,413 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, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:50,413 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:50,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash 457828852, now seen corresponding path program 1 times [2018-12-08 19:06:50,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:50,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:50,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:50,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:50,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:50,470 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-08 19:06:50,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:50,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:06:50,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:50,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:06:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:06:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:50,471 INFO L87 Difference]: Start difference. First operand 22976 states and 77268 transitions. Second operand 7 states. [2018-12-08 19:06:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:50,769 INFO L93 Difference]: Finished difference Result 24465 states and 82047 transitions. [2018-12-08 19:06:50,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:06:50,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 19:06:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:50,800 INFO L225 Difference]: With dead ends: 24465 [2018-12-08 19:06:50,800 INFO L226 Difference]: Without dead ends: 24465 [2018-12-08 19:06:50,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2018-12-08 19:06:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 22861. [2018-12-08 19:06:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22861 states. [2018-12-08 19:06:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 76956 transitions. [2018-12-08 19:06:51,173 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 76956 transitions. Word has length 102 [2018-12-08 19:06:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:51,173 INFO L480 AbstractCegarLoop]: Abstraction has 22861 states and 76956 transitions. [2018-12-08 19:06:51,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:06:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 76956 transitions. [2018-12-08 19:06:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:06:51,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:51,191 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, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:51,191 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:51,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1868708372, now seen corresponding path program 1 times [2018-12-08 19:06:51,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:51,251 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-08 19:06:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:06:51,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:51,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:06:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:06:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:51,252 INFO L87 Difference]: Start difference. First operand 22861 states and 76956 transitions. Second operand 5 states. [2018-12-08 19:06:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:51,373 INFO L93 Difference]: Finished difference Result 20572 states and 69257 transitions. [2018-12-08 19:06:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:06:51,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 19:06:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:51,399 INFO L225 Difference]: With dead ends: 20572 [2018-12-08 19:06:51,399 INFO L226 Difference]: Without dead ends: 20572 [2018-12-08 19:06:51,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20572 states. [2018-12-08 19:06:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20572 to 20102. [2018-12-08 19:06:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2018-12-08 19:06:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 67911 transitions. [2018-12-08 19:06:51,616 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 67911 transitions. Word has length 102 [2018-12-08 19:06:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:51,616 INFO L480 AbstractCegarLoop]: Abstraction has 20102 states and 67911 transitions. [2018-12-08 19:06:51,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:06:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 67911 transitions. [2018-12-08 19:06:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 19:06:51,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:51,634 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, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:51,634 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:51,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1420011733, now seen corresponding path program 1 times [2018-12-08 19:06:51,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:51,703 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-08 19:06:51,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:51,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:51,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:51,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:51,704 INFO L87 Difference]: Start difference. First operand 20102 states and 67911 transitions. Second operand 6 states. [2018-12-08 19:06:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:51,829 INFO L93 Difference]: Finished difference Result 12934 states and 42375 transitions. [2018-12-08 19:06:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:06:51,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 19:06:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:51,844 INFO L225 Difference]: With dead ends: 12934 [2018-12-08 19:06:51,845 INFO L226 Difference]: Without dead ends: 12934 [2018-12-08 19:06:51,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2018-12-08 19:06:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11445. [2018-12-08 19:06:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11445 states. [2018-12-08 19:06:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11445 states to 11445 states and 37761 transitions. [2018-12-08 19:06:51,968 INFO L78 Accepts]: Start accepts. Automaton has 11445 states and 37761 transitions. Word has length 102 [2018-12-08 19:06:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:51,968 INFO L480 AbstractCegarLoop]: Abstraction has 11445 states and 37761 transitions. [2018-12-08 19:06:51,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 11445 states and 37761 transitions. [2018-12-08 19:06:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:51,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:51,977 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:51,977 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:51,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2018-12-08 19:06:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:51,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:52,016 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-08 19:06:52,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:06:52,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:06:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:06:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:52,017 INFO L87 Difference]: Start difference. First operand 11445 states and 37761 transitions. Second operand 7 states. [2018-12-08 19:06:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:52,333 INFO L93 Difference]: Finished difference Result 18627 states and 60109 transitions. [2018-12-08 19:06:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 19:06:52,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-08 19:06:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:52,355 INFO L225 Difference]: With dead ends: 18627 [2018-12-08 19:06:52,355 INFO L226 Difference]: Without dead ends: 18499 [2018-12-08 19:06:52,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:06:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18499 states. [2018-12-08 19:06:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18499 to 14353. [2018-12-08 19:06:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14353 states. [2018-12-08 19:06:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14353 states to 14353 states and 46923 transitions. [2018-12-08 19:06:52,522 INFO L78 Accepts]: Start accepts. Automaton has 14353 states and 46923 transitions. Word has length 104 [2018-12-08 19:06:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:52,522 INFO L480 AbstractCegarLoop]: Abstraction has 14353 states and 46923 transitions. [2018-12-08 19:06:52,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:06:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 14353 states and 46923 transitions. [2018-12-08 19:06:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:52,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:52,533 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:52,534 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:52,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2018-12-08 19:06:52,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:52,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:52,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:52,591 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-08 19:06:52,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:52,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:52,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:52,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:52,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:52,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:52,592 INFO L87 Difference]: Start difference. First operand 14353 states and 46923 transitions. Second operand 6 states. [2018-12-08 19:06:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:52,717 INFO L93 Difference]: Finished difference Result 14593 states and 47275 transitions. [2018-12-08 19:06:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:06:52,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 19:06:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:52,733 INFO L225 Difference]: With dead ends: 14593 [2018-12-08 19:06:52,733 INFO L226 Difference]: Without dead ends: 14593 [2018-12-08 19:06:52,733 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-08 19:06:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2018-12-08 19:06:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 14203. [2018-12-08 19:06:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14203 states. [2018-12-08 19:06:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14203 states to 14203 states and 46213 transitions. [2018-12-08 19:06:52,878 INFO L78 Accepts]: Start accepts. Automaton has 14203 states and 46213 transitions. Word has length 104 [2018-12-08 19:06:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:52,879 INFO L480 AbstractCegarLoop]: Abstraction has 14203 states and 46213 transitions. [2018-12-08 19:06:52,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 14203 states and 46213 transitions. [2018-12-08 19:06:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:52,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:52,891 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:52,891 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:52,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2018-12-08 19:06:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:52,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:52,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:52,938 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-08 19:06:52,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:52,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:06:52,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:52,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:06:52,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:06:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:06:52,939 INFO L87 Difference]: Start difference. First operand 14203 states and 46213 transitions. Second operand 5 states. [2018-12-08 19:06:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:53,084 INFO L93 Difference]: Finished difference Result 15995 states and 51973 transitions. [2018-12-08 19:06:53,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:06:53,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-08 19:06:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:53,102 INFO L225 Difference]: With dead ends: 15995 [2018-12-08 19:06:53,102 INFO L226 Difference]: Without dead ends: 15867 [2018-12-08 19:06:53,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15867 states. [2018-12-08 19:06:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15867 to 11917. [2018-12-08 19:06:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11917 states. [2018-12-08 19:06:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 38975 transitions. [2018-12-08 19:06:53,237 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 38975 transitions. Word has length 104 [2018-12-08 19:06:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:53,237 INFO L480 AbstractCegarLoop]: Abstraction has 11917 states and 38975 transitions. [2018-12-08 19:06:53,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:06:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 38975 transitions. [2018-12-08 19:06:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:53,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:53,247 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:53,247 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:53,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1146708689, now seen corresponding path program 1 times [2018-12-08 19:06:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:53,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:53,305 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-08 19:06:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:53,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:53,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:53,306 INFO L87 Difference]: Start difference. First operand 11917 states and 38975 transitions. Second operand 6 states. [2018-12-08 19:06:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:53,441 INFO L93 Difference]: Finished difference Result 13633 states and 44061 transitions. [2018-12-08 19:06:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:53,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 19:06:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:53,457 INFO L225 Difference]: With dead ends: 13633 [2018-12-08 19:06:53,457 INFO L226 Difference]: Without dead ends: 13633 [2018-12-08 19:06:53,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:06:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2018-12-08 19:06:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 12112. [2018-12-08 19:06:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-08 19:06:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 39391 transitions. [2018-12-08 19:06:53,611 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 39391 transitions. Word has length 104 [2018-12-08 19:06:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:53,611 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 39391 transitions. [2018-12-08 19:06:53,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 39391 transitions. [2018-12-08 19:06:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:53,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:53,622 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:53,622 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-08 19:06:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:53,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:53,722 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-08 19:06:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:06:53,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:53,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:06:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:06:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:06:53,723 INFO L87 Difference]: Start difference. First operand 12112 states and 39391 transitions. Second operand 10 states. [2018-12-08 19:06:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:54,044 INFO L93 Difference]: Finished difference Result 22916 states and 74990 transitions. [2018-12-08 19:06:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:06:54,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-08 19:06:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:54,058 INFO L225 Difference]: With dead ends: 22916 [2018-12-08 19:06:54,058 INFO L226 Difference]: Without dead ends: 11388 [2018-12-08 19:06:54,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 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-08 19:06:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2018-12-08 19:06:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 11388. [2018-12-08 19:06:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11388 states. [2018-12-08 19:06:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11388 states to 11388 states and 37263 transitions. [2018-12-08 19:06:54,170 INFO L78 Accepts]: Start accepts. Automaton has 11388 states and 37263 transitions. Word has length 104 [2018-12-08 19:06:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:54,170 INFO L480 AbstractCegarLoop]: Abstraction has 11388 states and 37263 transitions. [2018-12-08 19:06:54,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:06:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 11388 states and 37263 transitions. [2018-12-08 19:06:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:54,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:54,179 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:54,180 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:54,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-08 19:06:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:54,234 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-08 19:06:54,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:54,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:06:54,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:54,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:06:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:06:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:06:54,235 INFO L87 Difference]: Start difference. First operand 11388 states and 37263 transitions. Second operand 7 states. [2018-12-08 19:06:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:54,449 INFO L93 Difference]: Finished difference Result 18978 states and 63024 transitions. [2018-12-08 19:06:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:54,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-08 19:06:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:54,460 INFO L225 Difference]: With dead ends: 18978 [2018-12-08 19:06:54,460 INFO L226 Difference]: Without dead ends: 7823 [2018-12-08 19:06:54,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-08 19:06:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2018-12-08 19:06:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2018-12-08 19:06:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7823 states. [2018-12-08 19:06:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 26371 transitions. [2018-12-08 19:06:54,535 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 26371 transitions. Word has length 104 [2018-12-08 19:06:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:54,535 INFO L480 AbstractCegarLoop]: Abstraction has 7823 states and 26371 transitions. [2018-12-08 19:06:54,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:06:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 26371 transitions. [2018-12-08 19:06:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:54,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:54,541 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:54,542 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:54,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-08 19:06:54,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:06:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:54,605 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-08 19:06:54,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:54,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:54,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:54,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:54,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:54,605 INFO L87 Difference]: Start difference. First operand 7823 states and 26371 transitions. Second operand 6 states. [2018-12-08 19:06:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:54,802 INFO L93 Difference]: Finished difference Result 8743 states and 28913 transitions. [2018-12-08 19:06:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:54,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 19:06:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:54,812 INFO L225 Difference]: With dead ends: 8743 [2018-12-08 19:06:54,812 INFO L226 Difference]: Without dead ends: 8743 [2018-12-08 19:06:54,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:06:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2018-12-08 19:06:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8003. [2018-12-08 19:06:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2018-12-08 19:06:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 26854 transitions. [2018-12-08 19:06:54,891 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 26854 transitions. Word has length 104 [2018-12-08 19:06:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:54,891 INFO L480 AbstractCegarLoop]: Abstraction has 8003 states and 26854 transitions. [2018-12-08 19:06:54,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 26854 transitions. [2018-12-08 19:06:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:54,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:54,898 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:54,899 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:54,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-08 19:06:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:54,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:54,944 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-08 19:06:54,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:54,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:54,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:54,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:54,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:54,945 INFO L87 Difference]: Start difference. First operand 8003 states and 26854 transitions. Second operand 6 states. [2018-12-08 19:06:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:55,070 INFO L93 Difference]: Finished difference Result 8063 states and 26991 transitions. [2018-12-08 19:06:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:06:55,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 19:06:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:55,079 INFO L225 Difference]: With dead ends: 8063 [2018-12-08 19:06:55,079 INFO L226 Difference]: Without dead ends: 7983 [2018-12-08 19:06:55,080 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-08 19:06:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2018-12-08 19:06:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7791. [2018-12-08 19:06:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7791 states. [2018-12-08 19:06:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 26267 transitions. [2018-12-08 19:06:55,154 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 26267 transitions. Word has length 104 [2018-12-08 19:06:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:55,155 INFO L480 AbstractCegarLoop]: Abstraction has 7791 states and 26267 transitions. [2018-12-08 19:06:55,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 26267 transitions. [2018-12-08 19:06:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:55,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:55,161 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:55,161 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:55,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 2 times [2018-12-08 19:06:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:55,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:06:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:55,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:06:55,220 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-08 19:06:55,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:06:55,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:06:55,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:06:55,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:06:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:06:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:06:55,220 INFO L87 Difference]: Start difference. First operand 7791 states and 26267 transitions. Second operand 6 states. [2018-12-08 19:06:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:06:55,311 INFO L93 Difference]: Finished difference Result 7959 states and 26677 transitions. [2018-12-08 19:06:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:06:55,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 19:06:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:06:55,321 INFO L225 Difference]: With dead ends: 7959 [2018-12-08 19:06:55,321 INFO L226 Difference]: Without dead ends: 7959 [2018-12-08 19:06:55,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-08 19:06:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2018-12-08 19:06:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7931. [2018-12-08 19:06:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7931 states. [2018-12-08 19:06:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 26604 transitions. [2018-12-08 19:06:55,403 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 26604 transitions. Word has length 104 [2018-12-08 19:06:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:06:55,403 INFO L480 AbstractCegarLoop]: Abstraction has 7931 states and 26604 transitions. [2018-12-08 19:06:55,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:06:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 26604 transitions. [2018-12-08 19:06:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 19:06:55,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:06:55,410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:06:55,410 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:06:55,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:06:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-08 19:06:55,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:06:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:55,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:06:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:06:55,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:06:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:06:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:06:55,448 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:06:55,516 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 19:06:55,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:06:55 BasicIcfg [2018-12-08 19:06:55,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:06:55,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:06:55,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:06:55,517 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:06:55,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:03:05" (3/4) ... [2018-12-08 19:06:55,519 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:06:55,589 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_089bbcd3-15fa-4d24-a0ed-1755cca41fc0/bin-2019/utaipan/witness.graphml [2018-12-08 19:06:55,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:06:55,590 INFO L168 Benchmark]: Toolchain (without parser) took 231252.76 ms. Allocated memory was 1.0 GB in the beginning and 10.7 GB in the end (delta: 9.7 GB). Free memory was 951.7 MB in the beginning and 7.3 GB in the end (delta: -6.3 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,591 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:06:55,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,591 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,591 INFO L168 Benchmark]: RCFGBuilder took 325.15 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,592 INFO L168 Benchmark]: TraceAbstraction took 230450.40 ms. Allocated memory was 1.1 GB in the beginning and 10.7 GB in the end (delta: 9.6 GB). Free memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: -6.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,592 INFO L168 Benchmark]: Witness Printer took 72.51 ms. Allocated memory is still 10.7 GB. Free memory was 7.3 GB in the beginning and 7.3 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:06:55,593 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.57 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.15 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 230450.40 ms. Allocated memory was 1.1 GB in the beginning and 10.7 GB in the end (delta: 9.6 GB). Free memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: -6.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 72.51 ms. Allocated memory is still 10.7 GB. Free memory was 7.3 GB in the beginning and 7.3 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1213; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1214; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1215; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 230.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 66.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9364 SDtfs, 9818 SDslu, 20196 SDs, 0 SdLazy, 8179 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 100 SyntacticMatches, 19 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479331occurred in iteration=15, 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: 142.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 1452249 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3019 ConstructedInterpolants, 0 QuantifiedInterpolants, 637638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...