./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/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 e9fa41860017546e776d4e58c6110a55f97650fc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:02:52,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:02:52,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:02:52,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:02:52,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:02:52,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:02:52,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:02:52,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:02:52,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:02:52,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:02:52,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:02:52,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:02:52,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:02:52,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:02:52,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:02:52,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:02:52,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:02:52,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:02:52,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:02:52,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:02:52,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:02:52,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:02:52,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:02:52,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:02:52,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:02:52,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:02:52,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:02:52,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:02:52,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:02:52,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:02:52,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:02:52,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:02:52,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:02:52,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:02:52,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:02:52,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:02:52,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:02:52,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:02:52,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:02:52,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:02:52,685 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:02:52,685 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:02:52,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:02:52,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:02:52,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:02:52,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:02:52,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:02:52,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:02:52,688 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_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/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 -> e9fa41860017546e776d4e58c6110a55f97650fc [2018-12-02 01:02:52,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:02:52,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:02:52,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:02:52,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:02:52,719 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:02:52,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt_false-unreach-call.i [2018-12-02 01:02:52,756 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/data/1dae913ee/e6d56d01cf734f2da71d9d5bd52c99f7/FLAG1ca4c5610 [2018-12-02 01:02:53,116 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:02:53,117 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/sv-benchmarks/c/pthread-wmm/rfi001_tso.opt_false-unreach-call.i [2018-12-02 01:02:53,126 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/data/1dae913ee/e6d56d01cf734f2da71d9d5bd52c99f7/FLAG1ca4c5610 [2018-12-02 01:02:53,135 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/data/1dae913ee/e6d56d01cf734f2da71d9d5bd52c99f7 [2018-12-02 01:02:53,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:02:53,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:02:53,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:02:53,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:02:53,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:02:53,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53, skipping insertion in model container [2018-12-02 01:02:53,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:02:53,176 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:02:53,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:02:53,399 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:02:53,476 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:02:53,505 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:02:53,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53 WrapperNode [2018-12-02 01:02:53,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:02:53,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:02:53,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:02:53,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:02:53,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:02:53,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:02:53,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:02:53,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:02:53,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... [2018-12-02 01:02:53,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:02:53,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:02:53,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:02:53,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:02:53,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 01:02:53,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 01:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 01:02:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 01:02:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 01:02:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:02:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:02:53,586 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 01:02:53,881 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:02:53,881 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 01:02:53,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:02:53 BoogieIcfgContainer [2018-12-02 01:02:53,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:02:53,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:02:53,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:02:53,883 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:02:53,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:02:53" (1/3) ... [2018-12-02 01:02:53,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:02:53, skipping insertion in model container [2018-12-02 01:02:53,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:02:53" (2/3) ... [2018-12-02 01:02:53,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e986ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:02:53, skipping insertion in model container [2018-12-02 01:02:53,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:02:53" (3/3) ... [2018-12-02 01:02:53,886 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt_false-unreach-call.i [2018-12-02 01:02:53,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,910 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,910 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:02:53,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 01:02:53,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:02:53,934 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 01:02:53,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 01:02:53,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:02:53,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:02:53,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:02:53,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:02:53,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:02:53,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:02:53,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:02:53,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:02:53,965 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 01:02:54,849 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-02 01:02:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-02 01:02:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 01:02:54,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:02:54,856 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] [2018-12-02 01:02:54,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:02:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:02:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-02 01:02:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:02:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:02:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:54,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:02:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:02:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:02:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:02:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:02:54,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:02:55,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:02:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:02:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:02:55,012 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-02 01:02:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:02:55,387 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-02 01:02:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:02:55,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 01:02:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:02:55,546 INFO L225 Difference]: With dead ends: 45389 [2018-12-02 01:02:55,547 INFO L226 Difference]: Without dead ends: 40629 [2018-12-02 01:02:55,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:02:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-02 01:02:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-02 01:02:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 01:02:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-02 01:02:56,233 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-02 01:02:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:02:56,234 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-02 01:02:56,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:02:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-02 01:02:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 01:02:56,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:02:56,236 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-02 01:02:56,236 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:02:56,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:02:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-02 01:02:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:02:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:02:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:56,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:02:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:02:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:02:56,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:02:56,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:02:56,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:02:56,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:02:56,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:02:56,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:02:56,277 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-02 01:02:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:02:56,427 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-02 01:02:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:02:56,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 01:02:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:02:56,594 INFO L225 Difference]: With dead ends: 23663 [2018-12-02 01:02:56,594 INFO L226 Difference]: Without dead ends: 23663 [2018-12-02 01:02:56,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:02:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-02 01:02:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-02 01:02:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 01:02:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-02 01:02:56,936 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-02 01:02:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:02:56,937 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-02 01:02:56,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:02:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-02 01:02:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 01:02:56,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:02:56,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:02:56,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:02:56,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:02:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-02 01:02:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:02:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:02:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:56,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:02:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:02:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:02:56,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:02:56,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:02:56,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:02:56,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:02:56,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:02:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:02:56,988 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-02 01:02:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:02:57,557 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-02 01:02:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:02:57,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 01:02:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:02:57,675 INFO L225 Difference]: With dead ends: 64831 [2018-12-02 01:02:57,675 INFO L226 Difference]: Without dead ends: 64671 [2018-12-02 01:02:57,675 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-02 01:02:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-02 01:02:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-02 01:02:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 01:02:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-02 01:02:58,469 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-02 01:02:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:02:58,470 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-02 01:02:58,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:02:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-02 01:02:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 01:02:58,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:02:58,472 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] [2018-12-02 01:02:58,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:02:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:02:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-02 01:02:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:02:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:02:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:58,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:02:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:02:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:02:58,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:02:58,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:02:58,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:02:58,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:02:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:02:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:02:58,521 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2018-12-02 01:02:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:02:58,894 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2018-12-02 01:02:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:02:58,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 01:02:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:02:59,013 INFO L225 Difference]: With dead ends: 66627 [2018-12-02 01:02:59,013 INFO L226 Difference]: Without dead ends: 66459 [2018-12-02 01:02:59,013 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-02 01:02:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-02 01:02:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-02 01:02:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-02 01:02:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2018-12-02 01:02:59,814 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2018-12-02 01:02:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:02:59,815 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2018-12-02 01:02:59,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:02:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2018-12-02 01:02:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 01:02:59,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:02:59,821 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-02 01:02:59,821 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:02:59,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:02:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1765825254, now seen corresponding path program 1 times [2018-12-02 01:02:59,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:02:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:02:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:02:59,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:02:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:02:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:02:59,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:02:59,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:02:59,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:02:59,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:02:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:02:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:02:59,847 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 3 states. [2018-12-02 01:02:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:02:59,993 INFO L93 Difference]: Finished difference Result 38835 states and 143586 transitions. [2018-12-02 01:02:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:02:59,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 01:02:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:00,061 INFO L225 Difference]: With dead ends: 38835 [2018-12-02 01:03:00,062 INFO L226 Difference]: Without dead ends: 38835 [2018-12-02 01:03:00,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38835 states. [2018-12-02 01:03:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38835 to 38835. [2018-12-02 01:03:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-02 01:03:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143586 transitions. [2018-12-02 01:03:00,647 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143586 transitions. Word has length 53 [2018-12-02 01:03:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:00,648 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143586 transitions. [2018-12-02 01:03:00,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:03:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143586 transitions. [2018-12-02 01:03:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 01:03:00,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:00,653 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-02 01:03:00,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:00,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash -23014919, now seen corresponding path program 1 times [2018-12-02 01:03:00,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:00,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:00,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:00,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:00,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:00,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:00,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:00,694 INFO L87 Difference]: Start difference. First operand 38835 states and 143586 transitions. Second operand 6 states. [2018-12-02 01:03:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:01,243 INFO L93 Difference]: Finished difference Result 68209 states and 246407 transitions. [2018-12-02 01:03:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:03:01,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 01:03:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:01,361 INFO L225 Difference]: With dead ends: 68209 [2018-12-02 01:03:01,361 INFO L226 Difference]: Without dead ends: 68049 [2018-12-02 01:03:01,361 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-02 01:03:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68049 states. [2018-12-02 01:03:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68049 to 37685. [2018-12-02 01:03:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37685 states. [2018-12-02 01:03:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37685 states to 37685 states and 139346 transitions. [2018-12-02 01:03:02,162 INFO L78 Accepts]: Start accepts. Automaton has 37685 states and 139346 transitions. Word has length 53 [2018-12-02 01:03:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:02,162 INFO L480 AbstractCegarLoop]: Abstraction has 37685 states and 139346 transitions. [2018-12-02 01:03:02,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 37685 states and 139346 transitions. [2018-12-02 01:03:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 01:03:02,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:02,175 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:02,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1558641035, now seen corresponding path program 1 times [2018-12-02 01:03:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:02,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:02,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:02,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:03:02,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:02,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:03:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:03:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:03:02,220 INFO L87 Difference]: Start difference. First operand 37685 states and 139346 transitions. Second operand 4 states. [2018-12-02 01:03:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:02,637 INFO L93 Difference]: Finished difference Result 60336 states and 220007 transitions. [2018-12-02 01:03:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:03:02,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 01:03:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:02,746 INFO L225 Difference]: With dead ends: 60336 [2018-12-02 01:03:02,746 INFO L226 Difference]: Without dead ends: 60040 [2018-12-02 01:03:02,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60040 states. [2018-12-02 01:03:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60040 to 50355. [2018-12-02 01:03:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50355 states. [2018-12-02 01:03:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50355 states to 50355 states and 185679 transitions. [2018-12-02 01:03:03,732 INFO L78 Accepts]: Start accepts. Automaton has 50355 states and 185679 transitions. Word has length 60 [2018-12-02 01:03:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:03,732 INFO L480 AbstractCegarLoop]: Abstraction has 50355 states and 185679 transitions. [2018-12-02 01:03:03,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:03:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 50355 states and 185679 transitions. [2018-12-02 01:03:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 01:03:03,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:03,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:03,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -205331338, now seen corresponding path program 1 times [2018-12-02 01:03:03,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:03,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:03,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:03,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:03,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:03,790 INFO L87 Difference]: Start difference. First operand 50355 states and 185679 transitions. Second operand 6 states. [2018-12-02 01:03:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:04,366 INFO L93 Difference]: Finished difference Result 100691 states and 366187 transitions. [2018-12-02 01:03:04,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:03:04,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 01:03:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:04,558 INFO L225 Difference]: With dead ends: 100691 [2018-12-02 01:03:04,558 INFO L226 Difference]: Without dead ends: 100435 [2018-12-02 01:03:04,558 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-02 01:03:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100435 states. [2018-12-02 01:03:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100435 to 57720. [2018-12-02 01:03:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57720 states. [2018-12-02 01:03:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57720 states to 57720 states and 210955 transitions. [2018-12-02 01:03:05,671 INFO L78 Accepts]: Start accepts. Automaton has 57720 states and 210955 transitions. Word has length 60 [2018-12-02 01:03:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:05,672 INFO L480 AbstractCegarLoop]: Abstraction has 57720 states and 210955 transitions. [2018-12-02 01:03:05,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 57720 states and 210955 transitions. [2018-12-02 01:03:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:03:05,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:05,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:05,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:05,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1421005029, now seen corresponding path program 1 times [2018-12-02 01:03:05,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:05,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:05,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:05,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:05,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:05,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:05,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:03:05,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:05,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:03:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:03:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:05,724 INFO L87 Difference]: Start difference. First operand 57720 states and 210955 transitions. Second operand 3 states. [2018-12-02 01:03:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:06,106 INFO L93 Difference]: Finished difference Result 70578 states and 254301 transitions. [2018-12-02 01:03:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:03:06,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-02 01:03:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:06,223 INFO L225 Difference]: With dead ends: 70578 [2018-12-02 01:03:06,224 INFO L226 Difference]: Without dead ends: 70578 [2018-12-02 01:03:06,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70578 states. [2018-12-02 01:03:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70578 to 61855. [2018-12-02 01:03:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61855 states. [2018-12-02 01:03:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61855 states to 61855 states and 225033 transitions. [2018-12-02 01:03:07,130 INFO L78 Accepts]: Start accepts. Automaton has 61855 states and 225033 transitions. Word has length 62 [2018-12-02 01:03:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:07,131 INFO L480 AbstractCegarLoop]: Abstraction has 61855 states and 225033 transitions. [2018-12-02 01:03:07,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:03:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 61855 states and 225033 transitions. [2018-12-02 01:03:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:03:07,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:07,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:07,165 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:07,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1661814372, now seen corresponding path program 1 times [2018-12-02 01:03:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:07,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:07,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:07,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:07,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:07,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:07,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:07,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:07,222 INFO L87 Difference]: Start difference. First operand 61855 states and 225033 transitions. Second operand 7 states. [2018-12-02 01:03:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:07,991 INFO L93 Difference]: Finished difference Result 108957 states and 390675 transitions. [2018-12-02 01:03:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:03:07,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-02 01:03:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:08,197 INFO L225 Difference]: With dead ends: 108957 [2018-12-02 01:03:08,197 INFO L226 Difference]: Without dead ends: 108701 [2018-12-02 01:03:08,197 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-02 01:03:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108701 states. [2018-12-02 01:03:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108701 to 63367. [2018-12-02 01:03:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63367 states. [2018-12-02 01:03:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63367 states to 63367 states and 230197 transitions. [2018-12-02 01:03:09,448 INFO L78 Accepts]: Start accepts. Automaton has 63367 states and 230197 transitions. Word has length 66 [2018-12-02 01:03:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:09,448 INFO L480 AbstractCegarLoop]: Abstraction has 63367 states and 230197 transitions. [2018-12-02 01:03:09,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 63367 states and 230197 transitions. [2018-12-02 01:03:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 01:03:09,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:09,481 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-02 01:03:09,481 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:09,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash -618382876, now seen corresponding path program 1 times [2018-12-02 01:03:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:09,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:09,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:09,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:09,548 INFO L87 Difference]: Start difference. First operand 63367 states and 230197 transitions. Second operand 5 states. [2018-12-02 01:03:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:10,099 INFO L93 Difference]: Finished difference Result 101266 states and 362936 transitions. [2018-12-02 01:03:10,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:03:10,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 01:03:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:10,291 INFO L225 Difference]: With dead ends: 101266 [2018-12-02 01:03:10,291 INFO L226 Difference]: Without dead ends: 101010 [2018-12-02 01:03:10,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101010 states. [2018-12-02 01:03:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101010 to 90651. [2018-12-02 01:03:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90651 states. [2018-12-02 01:03:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90651 states to 90651 states and 327218 transitions. [2018-12-02 01:03:11,985 INFO L78 Accepts]: Start accepts. Automaton has 90651 states and 327218 transitions. Word has length 67 [2018-12-02 01:03:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:11,986 INFO L480 AbstractCegarLoop]: Abstraction has 90651 states and 327218 transitions. [2018-12-02 01:03:11,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 90651 states and 327218 transitions. [2018-12-02 01:03:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 01:03:12,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:12,035 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-02 01:03:12,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:12,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -911785883, now seen corresponding path program 1 times [2018-12-02 01:03:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:12,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:12,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:12,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:12,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:12,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:12,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:12,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:12,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:12,081 INFO L87 Difference]: Start difference. First operand 90651 states and 327218 transitions. Second operand 7 states. [2018-12-02 01:03:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:12,947 INFO L93 Difference]: Finished difference Result 118588 states and 425014 transitions. [2018-12-02 01:03:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:03:12,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-02 01:03:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:13,171 INFO L225 Difference]: With dead ends: 118588 [2018-12-02 01:03:13,172 INFO L226 Difference]: Without dead ends: 118372 [2018-12-02 01:03:13,172 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-02 01:03:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118372 states. [2018-12-02 01:03:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118372 to 91420. [2018-12-02 01:03:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91420 states. [2018-12-02 01:03:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91420 states to 91420 states and 329711 transitions. [2018-12-02 01:03:14,761 INFO L78 Accepts]: Start accepts. Automaton has 91420 states and 329711 transitions. Word has length 67 [2018-12-02 01:03:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:14,761 INFO L480 AbstractCegarLoop]: Abstraction has 91420 states and 329711 transitions. [2018-12-02 01:03:14,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 91420 states and 329711 transitions. [2018-12-02 01:03:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 01:03:14,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:14,830 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-02 01:03:14,830 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:14,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -140132620, now seen corresponding path program 1 times [2018-12-02 01:03:14,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:14,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:14,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:14,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:14,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:14,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:14,891 INFO L87 Difference]: Start difference. First operand 91420 states and 329711 transitions. Second operand 6 states. [2018-12-02 01:03:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:15,590 INFO L93 Difference]: Finished difference Result 108145 states and 386365 transitions. [2018-12-02 01:03:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:03:15,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 01:03:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:15,789 INFO L225 Difference]: With dead ends: 108145 [2018-12-02 01:03:15,789 INFO L226 Difference]: Without dead ends: 106947 [2018-12-02 01:03:15,789 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-02 01:03:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106947 states. [2018-12-02 01:03:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106947 to 90444. [2018-12-02 01:03:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90444 states. [2018-12-02 01:03:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90444 states to 90444 states and 326340 transitions. [2018-12-02 01:03:17,225 INFO L78 Accepts]: Start accepts. Automaton has 90444 states and 326340 transitions. Word has length 69 [2018-12-02 01:03:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:17,225 INFO L480 AbstractCegarLoop]: Abstraction has 90444 states and 326340 transitions. [2018-12-02 01:03:17,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 90444 states and 326340 transitions. [2018-12-02 01:03:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 01:03:17,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:17,293 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-02 01:03:17,293 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:17,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash -423283084, now seen corresponding path program 1 times [2018-12-02 01:03:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:17,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:17,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:17,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:17,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:17,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:17,351 INFO L87 Difference]: Start difference. First operand 90444 states and 326340 transitions. Second operand 7 states. [2018-12-02 01:03:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:18,161 INFO L93 Difference]: Finished difference Result 120574 states and 424898 transitions. [2018-12-02 01:03:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:03:18,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-02 01:03:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:18,384 INFO L225 Difference]: With dead ends: 120574 [2018-12-02 01:03:18,384 INFO L226 Difference]: Without dead ends: 120574 [2018-12-02 01:03:18,384 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-02 01:03:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120574 states. [2018-12-02 01:03:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120574 to 111084. [2018-12-02 01:03:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111084 states. [2018-12-02 01:03:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111084 states to 111084 states and 394692 transitions. [2018-12-02 01:03:20,254 INFO L78 Accepts]: Start accepts. Automaton has 111084 states and 394692 transitions. Word has length 69 [2018-12-02 01:03:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:20,254 INFO L480 AbstractCegarLoop]: Abstraction has 111084 states and 394692 transitions. [2018-12-02 01:03:20,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111084 states and 394692 transitions. [2018-12-02 01:03:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 01:03:20,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:20,335 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-02 01:03:20,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:20,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash 821481397, now seen corresponding path program 1 times [2018-12-02 01:03:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:20,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:20,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:20,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:20,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:03:20,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:20,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:03:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:03:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:03:20,377 INFO L87 Difference]: Start difference. First operand 111084 states and 394692 transitions. Second operand 4 states. [2018-12-02 01:03:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:20,478 INFO L93 Difference]: Finished difference Result 35081 states and 113191 transitions. [2018-12-02 01:03:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:03:20,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-02 01:03:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:20,524 INFO L225 Difference]: With dead ends: 35081 [2018-12-02 01:03:20,524 INFO L226 Difference]: Without dead ends: 34540 [2018-12-02 01:03:20,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34540 states. [2018-12-02 01:03:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34540 to 34528. [2018-12-02 01:03:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34528 states. [2018-12-02 01:03:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34528 states to 34528 states and 111547 transitions. [2018-12-02 01:03:20,874 INFO L78 Accepts]: Start accepts. Automaton has 34528 states and 111547 transitions. Word has length 69 [2018-12-02 01:03:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:20,874 INFO L480 AbstractCegarLoop]: Abstraction has 34528 states and 111547 transitions. [2018-12-02 01:03:20,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:03:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 34528 states and 111547 transitions. [2018-12-02 01:03:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 01:03:20,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:20,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:20,895 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:20,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1605948861, now seen corresponding path program 1 times [2018-12-02 01:03:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:20,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:20,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:03:20,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:20,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:03:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:03:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:20,935 INFO L87 Difference]: Start difference. First operand 34528 states and 111547 transitions. Second operand 8 states. [2018-12-02 01:03:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:21,575 INFO L93 Difference]: Finished difference Result 37868 states and 121548 transitions. [2018-12-02 01:03:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 01:03:21,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-02 01:03:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:21,625 INFO L225 Difference]: With dead ends: 37868 [2018-12-02 01:03:21,625 INFO L226 Difference]: Without dead ends: 37804 [2018-12-02 01:03:21,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-02 01:03:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37804 states. [2018-12-02 01:03:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37804 to 29484. [2018-12-02 01:03:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29484 states. [2018-12-02 01:03:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 96024 transitions. [2018-12-02 01:03:21,990 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 96024 transitions. Word has length 79 [2018-12-02 01:03:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:21,991 INFO L480 AbstractCegarLoop]: Abstraction has 29484 states and 96024 transitions. [2018-12-02 01:03:21,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:03:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 96024 transitions. [2018-12-02 01:03:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 01:03:22,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:22,011 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] [2018-12-02 01:03:22,011 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:22,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash 509727806, now seen corresponding path program 1 times [2018-12-02 01:03:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:22,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:22,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:22,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:03:22,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:22,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:03:22,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:03:22,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:22,035 INFO L87 Difference]: Start difference. First operand 29484 states and 96024 transitions. Second operand 3 states. [2018-12-02 01:03:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:22,247 INFO L93 Difference]: Finished difference Result 31936 states and 103482 transitions. [2018-12-02 01:03:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:03:22,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-02 01:03:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:22,286 INFO L225 Difference]: With dead ends: 31936 [2018-12-02 01:03:22,286 INFO L226 Difference]: Without dead ends: 31936 [2018-12-02 01:03:22,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31936 states. [2018-12-02 01:03:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31936 to 30704. [2018-12-02 01:03:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30704 states. [2018-12-02 01:03:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30704 states to 30704 states and 99736 transitions. [2018-12-02 01:03:22,633 INFO L78 Accepts]: Start accepts. Automaton has 30704 states and 99736 transitions. Word has length 80 [2018-12-02 01:03:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:22,633 INFO L480 AbstractCegarLoop]: Abstraction has 30704 states and 99736 transitions. [2018-12-02 01:03:22,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:03:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30704 states and 99736 transitions. [2018-12-02 01:03:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 01:03:22,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:22,655 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] [2018-12-02 01:03:22,655 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:22,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 723145821, now seen corresponding path program 1 times [2018-12-02 01:03:22,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:22,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:22,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:22,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:22,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:22,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:03:22,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:22,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:03:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:03:22,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:03:22,682 INFO L87 Difference]: Start difference. First operand 30704 states and 99736 transitions. Second operand 4 states. [2018-12-02 01:03:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:22,901 INFO L93 Difference]: Finished difference Result 36586 states and 117203 transitions. [2018-12-02 01:03:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:03:22,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 01:03:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:22,948 INFO L225 Difference]: With dead ends: 36586 [2018-12-02 01:03:22,948 INFO L226 Difference]: Without dead ends: 36410 [2018-12-02 01:03:22,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:03:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36410 states. [2018-12-02 01:03:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36410 to 34718. [2018-12-02 01:03:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34718 states. [2018-12-02 01:03:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34718 states to 34718 states and 111870 transitions. [2018-12-02 01:03:23,349 INFO L78 Accepts]: Start accepts. Automaton has 34718 states and 111870 transitions. Word has length 81 [2018-12-02 01:03:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:23,349 INFO L480 AbstractCegarLoop]: Abstraction has 34718 states and 111870 transitions. [2018-12-02 01:03:23,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:03:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 34718 states and 111870 transitions. [2018-12-02 01:03:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 01:03:23,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:23,376 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] [2018-12-02 01:03:23,377 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:23,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1212514466, now seen corresponding path program 1 times [2018-12-02 01:03:23,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:23,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:23,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:03:23,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:23,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:03:23,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:03:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:23,418 INFO L87 Difference]: Start difference. First operand 34718 states and 111870 transitions. Second operand 3 states. [2018-12-02 01:03:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:23,608 INFO L93 Difference]: Finished difference Result 37212 states and 119443 transitions. [2018-12-02 01:03:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:03:23,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-02 01:03:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:23,656 INFO L225 Difference]: With dead ends: 37212 [2018-12-02 01:03:23,656 INFO L226 Difference]: Without dead ends: 37212 [2018-12-02 01:03:23,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:03:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37212 states. [2018-12-02 01:03:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37212 to 35974. [2018-12-02 01:03:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2018-12-02 01:03:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 115678 transitions. [2018-12-02 01:03:24,094 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 115678 transitions. Word has length 81 [2018-12-02 01:03:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:24,094 INFO L480 AbstractCegarLoop]: Abstraction has 35974 states and 115678 transitions. [2018-12-02 01:03:24,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:03:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 115678 transitions. [2018-12-02 01:03:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:24,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:24,123 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] [2018-12-02 01:03:24,124 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:24,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1773086822, now seen corresponding path program 1 times [2018-12-02 01:03:24,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:24,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:24,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:24,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:24,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:24,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:24,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:24,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:24,195 INFO L87 Difference]: Start difference. First operand 35974 states and 115678 transitions. Second operand 6 states. [2018-12-02 01:03:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:24,721 INFO L93 Difference]: Finished difference Result 53376 states and 167986 transitions. [2018-12-02 01:03:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:03:24,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 01:03:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:24,793 INFO L225 Difference]: With dead ends: 53376 [2018-12-02 01:03:24,793 INFO L226 Difference]: Without dead ends: 52716 [2018-12-02 01:03:24,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:03:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52716 states. [2018-12-02 01:03:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52716 to 40300. [2018-12-02 01:03:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2018-12-02 01:03:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 129407 transitions. [2018-12-02 01:03:25,313 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 129407 transitions. Word has length 82 [2018-12-02 01:03:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:25,313 INFO L480 AbstractCegarLoop]: Abstraction has 40300 states and 129407 transitions. [2018-12-02 01:03:25,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 129407 transitions. [2018-12-02 01:03:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:25,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:25,344 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] [2018-12-02 01:03:25,344 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:25,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1489936358, now seen corresponding path program 1 times [2018-12-02 01:03:25,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:25,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:25,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:25,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:25,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:25,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:25,383 INFO L87 Difference]: Start difference. First operand 40300 states and 129407 transitions. Second operand 7 states. [2018-12-02 01:03:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:26,138 INFO L93 Difference]: Finished difference Result 65896 states and 204960 transitions. [2018-12-02 01:03:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 01:03:26,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 01:03:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:26,226 INFO L225 Difference]: With dead ends: 65896 [2018-12-02 01:03:26,226 INFO L226 Difference]: Without dead ends: 65784 [2018-12-02 01:03:26,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-02 01:03:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65784 states. [2018-12-02 01:03:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65784 to 42525. [2018-12-02 01:03:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2018-12-02 01:03:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 134449 transitions. [2018-12-02 01:03:26,849 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 134449 transitions. Word has length 82 [2018-12-02 01:03:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:26,850 INFO L480 AbstractCegarLoop]: Abstraction has 42525 states and 134449 transitions. [2018-12-02 01:03:26,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 134449 transitions. [2018-12-02 01:03:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:26,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:26,883 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] [2018-12-02 01:03:26,883 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:26,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1230500696, now seen corresponding path program 1 times [2018-12-02 01:03:26,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:26,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:26,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:26,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:26,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:26,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:26,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:26,927 INFO L87 Difference]: Start difference. First operand 42525 states and 134449 transitions. Second operand 7 states. [2018-12-02 01:03:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:27,558 INFO L93 Difference]: Finished difference Result 79413 states and 247508 transitions. [2018-12-02 01:03:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:03:27,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 01:03:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:27,668 INFO L225 Difference]: With dead ends: 79413 [2018-12-02 01:03:27,668 INFO L226 Difference]: Without dead ends: 78477 [2018-12-02 01:03:27,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:03:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78477 states. [2018-12-02 01:03:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78477 to 45874. [2018-12-02 01:03:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45874 states. [2018-12-02 01:03:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45874 states to 45874 states and 144580 transitions. [2018-12-02 01:03:28,358 INFO L78 Accepts]: Start accepts. Automaton has 45874 states and 144580 transitions. Word has length 82 [2018-12-02 01:03:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 45874 states and 144580 transitions. [2018-12-02 01:03:28,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 45874 states and 144580 transitions. [2018-12-02 01:03:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:28,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:28,394 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] [2018-12-02 01:03:28,394 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:28,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169000, now seen corresponding path program 1 times [2018-12-02 01:03:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:28,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:28,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:28,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:03:28,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:28,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:03:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:03:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:28,468 INFO L87 Difference]: Start difference. First operand 45874 states and 144580 transitions. Second operand 8 states. [2018-12-02 01:03:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:29,982 INFO L93 Difference]: Finished difference Result 68189 states and 208948 transitions. [2018-12-02 01:03:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 01:03:29,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-02 01:03:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:30,075 INFO L225 Difference]: With dead ends: 68189 [2018-12-02 01:03:30,075 INFO L226 Difference]: Without dead ends: 67313 [2018-12-02 01:03:30,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-02 01:03:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67313 states. [2018-12-02 01:03:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67313 to 43240. [2018-12-02 01:03:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43240 states. [2018-12-02 01:03:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43240 states to 43240 states and 135793 transitions. [2018-12-02 01:03:30,699 INFO L78 Accepts]: Start accepts. Automaton has 43240 states and 135793 transitions. Word has length 82 [2018-12-02 01:03:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:30,699 INFO L480 AbstractCegarLoop]: Abstraction has 43240 states and 135793 transitions. [2018-12-02 01:03:30,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:03:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 43240 states and 135793 transitions. [2018-12-02 01:03:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:30,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:30,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:30,731 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:30,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2141783017, now seen corresponding path program 1 times [2018-12-02 01:03:30,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:30,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:30,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:30,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:30,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:30,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:30,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:03:30,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:30,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:03:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:03:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:30,796 INFO L87 Difference]: Start difference. First operand 43240 states and 135793 transitions. Second operand 8 states. [2018-12-02 01:03:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:31,668 INFO L93 Difference]: Finished difference Result 54812 states and 170417 transitions. [2018-12-02 01:03:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 01:03:31,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-02 01:03:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:31,740 INFO L225 Difference]: With dead ends: 54812 [2018-12-02 01:03:31,741 INFO L226 Difference]: Without dead ends: 54812 [2018-12-02 01:03:31,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:03:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54812 states. [2018-12-02 01:03:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54812 to 38160. [2018-12-02 01:03:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38160 states. [2018-12-02 01:03:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38160 states to 38160 states and 120067 transitions. [2018-12-02 01:03:32,259 INFO L78 Accepts]: Start accepts. Automaton has 38160 states and 120067 transitions. Word has length 82 [2018-12-02 01:03:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:32,259 INFO L480 AbstractCegarLoop]: Abstraction has 38160 states and 120067 transitions. [2018-12-02 01:03:32,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:03:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38160 states and 120067 transitions. [2018-12-02 01:03:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:32,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:32,288 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] [2018-12-02 01:03:32,288 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:32,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1672467863, now seen corresponding path program 1 times [2018-12-02 01:03:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:32,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:32,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 01:03:32,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:32,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:03:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:03:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:03:32,350 INFO L87 Difference]: Start difference. First operand 38160 states and 120067 transitions. Second operand 9 states. [2018-12-02 01:03:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:33,724 INFO L93 Difference]: Finished difference Result 54768 states and 167807 transitions. [2018-12-02 01:03:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:03:33,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-02 01:03:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:33,795 INFO L225 Difference]: With dead ends: 54768 [2018-12-02 01:03:33,795 INFO L226 Difference]: Without dead ends: 54768 [2018-12-02 01:03:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:03:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54768 states. [2018-12-02 01:03:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54768 to 41204. [2018-12-02 01:03:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41204 states. [2018-12-02 01:03:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41204 states to 41204 states and 129330 transitions. [2018-12-02 01:03:34,345 INFO L78 Accepts]: Start accepts. Automaton has 41204 states and 129330 transitions. Word has length 82 [2018-12-02 01:03:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:34,346 INFO L480 AbstractCegarLoop]: Abstraction has 41204 states and 129330 transitions. [2018-12-02 01:03:34,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:03:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41204 states and 129330 transitions. [2018-12-02 01:03:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:03:34,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:34,377 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] [2018-12-02 01:03:34,377 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:34,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash -427703382, now seen corresponding path program 1 times [2018-12-02 01:03:34,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:34,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:34,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:34,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:34,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:34,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:34,423 INFO L87 Difference]: Start difference. First operand 41204 states and 129330 transitions. Second operand 5 states. [2018-12-02 01:03:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:34,448 INFO L93 Difference]: Finished difference Result 5368 states and 14053 transitions. [2018-12-02 01:03:34,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:03:34,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-02 01:03:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:34,452 INFO L225 Difference]: With dead ends: 5368 [2018-12-02 01:03:34,452 INFO L226 Difference]: Without dead ends: 4792 [2018-12-02 01:03:34,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2018-12-02 01:03:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4628. [2018-12-02 01:03:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4628 states. [2018-12-02 01:03:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 12173 transitions. [2018-12-02 01:03:34,490 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 12173 transitions. Word has length 82 [2018-12-02 01:03:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:34,490 INFO L480 AbstractCegarLoop]: Abstraction has 4628 states and 12173 transitions. [2018-12-02 01:03:34,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 12173 transitions. [2018-12-02 01:03:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:34,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:34,493 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] [2018-12-02 01:03:34,493 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:34,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1928340439, now seen corresponding path program 1 times [2018-12-02 01:03:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:34,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:34,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:34,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:34,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:34,543 INFO L87 Difference]: Start difference. First operand 4628 states and 12173 transitions. Second operand 5 states. [2018-12-02 01:03:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:34,665 INFO L93 Difference]: Finished difference Result 5288 states and 13754 transitions. [2018-12-02 01:03:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:03:34,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 01:03:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:34,669 INFO L225 Difference]: With dead ends: 5288 [2018-12-02 01:03:34,669 INFO L226 Difference]: Without dead ends: 5288 [2018-12-02 01:03:34,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2018-12-02 01:03:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4680. [2018-12-02 01:03:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2018-12-02 01:03:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 12285 transitions. [2018-12-02 01:03:34,705 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 12285 transitions. Word has length 94 [2018-12-02 01:03:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:34,705 INFO L480 AbstractCegarLoop]: Abstraction has 4680 states and 12285 transitions. [2018-12-02 01:03:34,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 12285 transitions. [2018-12-02 01:03:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:34,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:34,708 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] [2018-12-02 01:03:34,709 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:34,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -758672297, now seen corresponding path program 1 times [2018-12-02 01:03:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:34,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:34,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:34,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:34,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:34,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:34,760 INFO L87 Difference]: Start difference. First operand 4680 states and 12285 transitions. Second operand 6 states. [2018-12-02 01:03:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:34,959 INFO L93 Difference]: Finished difference Result 4961 states and 12836 transitions. [2018-12-02 01:03:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:03:34,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 01:03:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:34,963 INFO L225 Difference]: With dead ends: 4961 [2018-12-02 01:03:34,963 INFO L226 Difference]: Without dead ends: 4924 [2018-12-02 01:03:34,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2018-12-02 01:03:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4854. [2018-12-02 01:03:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2018-12-02 01:03:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 12636 transitions. [2018-12-02 01:03:35,006 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 12636 transitions. Word has length 94 [2018-12-02 01:03:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:35,006 INFO L480 AbstractCegarLoop]: Abstraction has 4854 states and 12636 transitions. [2018-12-02 01:03:35,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 12636 transitions. [2018-12-02 01:03:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:35,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:35,009 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] [2018-12-02 01:03:35,009 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:35,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash 942068182, now seen corresponding path program 1 times [2018-12-02 01:03:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:35,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:03:35,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:35,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:03:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:03:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:35,054 INFO L87 Difference]: Start difference. First operand 4854 states and 12636 transitions. Second operand 7 states. [2018-12-02 01:03:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:35,288 INFO L93 Difference]: Finished difference Result 5162 states and 13383 transitions. [2018-12-02 01:03:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:03:35,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 01:03:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:35,292 INFO L225 Difference]: With dead ends: 5162 [2018-12-02 01:03:35,292 INFO L226 Difference]: Without dead ends: 5162 [2018-12-02 01:03:35,292 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-02 01:03:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2018-12-02 01:03:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 4836. [2018-12-02 01:03:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-12-02 01:03:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12599 transitions. [2018-12-02 01:03:35,329 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12599 transitions. Word has length 94 [2018-12-02 01:03:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:35,329 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12599 transitions. [2018-12-02 01:03:35,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:03:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12599 transitions. [2018-12-02 01:03:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:35,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:35,332 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] [2018-12-02 01:03:35,332 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:35,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1942019594, now seen corresponding path program 1 times [2018-12-02 01:03:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:35,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:35,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:35,364 INFO L87 Difference]: Start difference. First operand 4836 states and 12599 transitions. Second operand 5 states. [2018-12-02 01:03:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:35,424 INFO L93 Difference]: Finished difference Result 4836 states and 12558 transitions. [2018-12-02 01:03:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:03:35,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 01:03:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:35,428 INFO L225 Difference]: With dead ends: 4836 [2018-12-02 01:03:35,428 INFO L226 Difference]: Without dead ends: 4836 [2018-12-02 01:03:35,428 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-02 01:03:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2018-12-02 01:03:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4836. [2018-12-02 01:03:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-12-02 01:03:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12558 transitions. [2018-12-02 01:03:35,461 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12558 transitions. Word has length 94 [2018-12-02 01:03:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:35,461 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12558 transitions. [2018-12-02 01:03:35,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12558 transitions. [2018-12-02 01:03:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:35,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:35,464 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] [2018-12-02 01:03:35,464 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:35,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash 306211757, now seen corresponding path program 1 times [2018-12-02 01:03:35,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:35,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:35,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:35,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:35,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:35,503 INFO L87 Difference]: Start difference. First operand 4836 states and 12558 transitions. Second operand 5 states. [2018-12-02 01:03:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:35,606 INFO L93 Difference]: Finished difference Result 9489 states and 24896 transitions. [2018-12-02 01:03:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:03:35,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 01:03:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:35,613 INFO L225 Difference]: With dead ends: 9489 [2018-12-02 01:03:35,613 INFO L226 Difference]: Without dead ends: 9489 [2018-12-02 01:03:35,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9489 states. [2018-12-02 01:03:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9489 to 4892. [2018-12-02 01:03:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2018-12-02 01:03:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 12672 transitions. [2018-12-02 01:03:35,662 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 12672 transitions. Word has length 94 [2018-12-02 01:03:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:35,662 INFO L480 AbstractCegarLoop]: Abstraction has 4892 states and 12672 transitions. [2018-12-02 01:03:35,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 12672 transitions. [2018-12-02 01:03:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 01:03:35,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:35,665 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] [2018-12-02 01:03:35,666 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:35,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2053095252, now seen corresponding path program 1 times [2018-12-02 01:03:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:35,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:35,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:03:35,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:35,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:03:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:03:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:35,738 INFO L87 Difference]: Start difference. First operand 4892 states and 12672 transitions. Second operand 6 states. [2018-12-02 01:03:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:35,789 INFO L93 Difference]: Finished difference Result 3772 states and 9408 transitions. [2018-12-02 01:03:35,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:03:35,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 01:03:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:35,792 INFO L225 Difference]: With dead ends: 3772 [2018-12-02 01:03:35,792 INFO L226 Difference]: Without dead ends: 3772 [2018-12-02 01:03:35,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:03:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2018-12-02 01:03:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3058. [2018-12-02 01:03:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2018-12-02 01:03:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 7722 transitions. [2018-12-02 01:03:35,814 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 7722 transitions. Word has length 94 [2018-12-02 01:03:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:35,814 INFO L480 AbstractCegarLoop]: Abstraction has 3058 states and 7722 transitions. [2018-12-02 01:03:35,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:03:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 7722 transitions. [2018-12-02 01:03:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:35,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:35,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:35,816 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:35,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-02 01:03:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:35,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:35,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:35,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:03:35,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:35,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:03:35,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:03:35,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:03:35,863 INFO L87 Difference]: Start difference. First operand 3058 states and 7722 transitions. Second operand 8 states. [2018-12-02 01:03:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:36,175 INFO L93 Difference]: Finished difference Result 7304 states and 18572 transitions. [2018-12-02 01:03:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 01:03:36,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 01:03:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:36,181 INFO L225 Difference]: With dead ends: 7304 [2018-12-02 01:03:36,181 INFO L226 Difference]: Without dead ends: 7272 [2018-12-02 01:03:36,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:03:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-02 01:03:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 3769. [2018-12-02 01:03:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2018-12-02 01:03:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 9441 transitions. [2018-12-02 01:03:36,218 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 9441 transitions. Word has length 96 [2018-12-02 01:03:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:36,219 INFO L480 AbstractCegarLoop]: Abstraction has 3769 states and 9441 transitions. [2018-12-02 01:03:36,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:03:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 9441 transitions. [2018-12-02 01:03:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:36,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:36,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:36,221 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:36,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-02 01:03:36,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:36,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:36,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:36,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:36,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:36,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:36,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:36,266 INFO L87 Difference]: Start difference. First operand 3769 states and 9441 transitions. Second operand 5 states. [2018-12-02 01:03:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:36,289 INFO L93 Difference]: Finished difference Result 5639 states and 14430 transitions. [2018-12-02 01:03:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:03:36,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 01:03:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:36,293 INFO L225 Difference]: With dead ends: 5639 [2018-12-02 01:03:36,293 INFO L226 Difference]: Without dead ends: 5639 [2018-12-02 01:03:36,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:03:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2018-12-02 01:03:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3550. [2018-12-02 01:03:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-12-02 01:03:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 8942 transitions. [2018-12-02 01:03:36,324 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 8942 transitions. Word has length 96 [2018-12-02 01:03:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:36,324 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 8942 transitions. [2018-12-02 01:03:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 8942 transitions. [2018-12-02 01:03:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:36,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:36,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:36,327 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:36,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-02 01:03:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:36,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:36,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:03:36,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:36,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:03:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:03:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:03:36,362 INFO L87 Difference]: Start difference. First operand 3550 states and 8942 transitions. Second operand 5 states. [2018-12-02 01:03:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:36,466 INFO L93 Difference]: Finished difference Result 3998 states and 10046 transitions. [2018-12-02 01:03:36,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:03:36,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 01:03:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:36,468 INFO L225 Difference]: With dead ends: 3998 [2018-12-02 01:03:36,468 INFO L226 Difference]: Without dead ends: 3966 [2018-12-02 01:03:36,469 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-02 01:03:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2018-12-02 01:03:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3046. [2018-12-02 01:03:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2018-12-02 01:03:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 7688 transitions. [2018-12-02 01:03:36,490 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 7688 transitions. Word has length 96 [2018-12-02 01:03:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:36,490 INFO L480 AbstractCegarLoop]: Abstraction has 3046 states and 7688 transitions. [2018-12-02 01:03:36,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:03:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 7688 transitions. [2018-12-02 01:03:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:36,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:36,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:36,492 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:36,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-02 01:03:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:36,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:36,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 01:03:36,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:36,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 01:03:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:03:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:03:36,579 INFO L87 Difference]: Start difference. First operand 3046 states and 7688 transitions. Second operand 10 states. [2018-12-02 01:03:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:36,840 INFO L93 Difference]: Finished difference Result 5121 states and 13059 transitions. [2018-12-02 01:03:36,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:03:36,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-02 01:03:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:36,842 INFO L225 Difference]: With dead ends: 5121 [2018-12-02 01:03:36,842 INFO L226 Difference]: Without dead ends: 2051 [2018-12-02 01:03:36,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:03:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2018-12-02 01:03:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2018-12-02 01:03:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-02 01:03:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-02 01:03:36,855 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-02 01:03:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:36,855 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-02 01:03:36,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 01:03:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-02 01:03:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:36,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:36,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:36,856 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:36,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:36,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-02 01:03:36,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:36,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:03:36,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:36,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:03:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:03:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:03:36,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 01:03:36,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:03:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:03:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:03:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:03:36,927 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-02 01:03:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:03:37,283 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-02 01:03:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:03:37,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 01:03:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:03:37,285 INFO L225 Difference]: With dead ends: 3882 [2018-12-02 01:03:37,285 INFO L226 Difference]: Without dead ends: 2746 [2018-12-02 01:03:37,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 01:03:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-02 01:03:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-02 01:03:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-02 01:03:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-02 01:03:37,302 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-02 01:03:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:03:37,302 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-02 01:03:37,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:03:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-02 01:03:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:03:37,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:03:37,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:03:37,304 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:03:37,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:03:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-02 01:03:37,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:03:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:37,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:03:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:03:37,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:03:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:03:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:03:37,351 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:03:37,420 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 01:03:37,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:03:37 BasicIcfg [2018-12-02 01:03:37,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:03:37,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:03:37,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:03:37,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:03:37,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:02:53" (3/4) ... [2018-12-02 01:03:37,424 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:03:37,492 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ff3047f4-3bf3-4173-aa4f-f55743f35a8a/bin-2019/utaipan/witness.graphml [2018-12-02 01:03:37,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:03:37,492 INFO L168 Benchmark]: Toolchain (without parser) took 44354.03 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 948.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 01:03:37,493 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:03:37,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:03:37,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.40 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-02 01:03:37,494 INFO L168 Benchmark]: Boogie Preprocessor took 17.97 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-02 01:03:37,494 INFO L168 Benchmark]: RCFGBuilder took 326.62 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:03:37,494 INFO L168 Benchmark]: TraceAbstraction took 43539.66 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 01:03:37,494 INFO L168 Benchmark]: Witness Printer took 70.31 ms. Allocated memory is still 4.4 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:03:37,495 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.40 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 17.97 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 326.62 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43539.66 ms. Allocated memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 70.31 ms. Allocated memory is still 4.4 GB. Free memory is still 2.7 GB. There was no memory consumed. 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] -1 pthread_t t1617; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L766] FCALL, FORK -1 pthread_create(&t1617, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] -1 pthread_t t1618; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] FCALL, FORK -1 pthread_create(&t1618, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 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 [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 0 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L785] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L785] -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) [L786] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L786] -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)) [L787] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] -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)) [L788] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L788] -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)) [L789] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L789] -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)) [L790] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] -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)) [L791] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] -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)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 43.4s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11301 SDtfs, 13092 SDslu, 29670 SDs, 0 SdLazy, 14368 SolverSat, 805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 117 SyntacticMatches, 24 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111084occurred in iteration=14, 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: 20.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 420461 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2771 ConstructedInterpolants, 0 QuantifiedInterpolants, 523124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...