./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c --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_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/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 43303747b241581a2f6fa42bd0d545137dba7f4f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:26:26,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:26:26,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:26:26,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:26:26,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:26:26,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:26:26,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:26:26,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:26:26,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:26:26,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:26:26,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:26:26,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:26:26,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:26:26,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:26:26,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:26:26,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:26:26,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:26:26,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:26:26,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:26:26,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:26:26,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:26:26,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:26:26,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:26:26,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:26:26,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:26:26,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:26:26,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:26:26,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:26:26,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:26:26,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:26:26,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:26:26,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:26:26,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:26:26,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:26:26,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:26:26,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:26:26,623 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 05:26:26,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:26:26,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:26:26,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:26:26,631 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:26:26,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:26:26,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:26:26,632 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:26:26,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:26:26,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:26:26,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:26:26,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:26:26,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:26:26,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:26:26,635 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:26:26,635 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_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/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 -> 43303747b241581a2f6fa42bd0d545137dba7f4f [2018-12-09 05:26:26,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:26:26,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:26:26,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:26:26,661 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:26:26,662 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:26:26,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c [2018-12-09 05:26:26,699 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/data/d8853b6e0/57c1378053d84f9894d84fc7262fd8d6/FLAGb9d6168c9 [2018-12-09 05:26:32,848 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:26:32,848 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c [2018-12-09 05:26:34,123 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/data/d8853b6e0/57c1378053d84f9894d84fc7262fd8d6/FLAGb9d6168c9 [2018-12-09 05:26:34,133 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/data/d8853b6e0/57c1378053d84f9894d84fc7262fd8d6 [2018-12-09 05:26:34,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:26:34,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:26:34,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:26:34,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:26:34,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:26:34,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:26:34" (1/1) ... [2018-12-09 05:26:34,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97cb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:26:34, skipping insertion in model container [2018-12-09 05:26:34,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:26:34" (1/1) ... [2018-12-09 05:26:34,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:26:41,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:28:41,010 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:28:41,015 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:30:20,874 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:30:20,888 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:30:20,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20 WrapperNode [2018-12-09 05:30:20,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:30:20,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:30:20,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:30:20,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:30:20,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:24,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:24,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:30:24,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:30:24,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:30:24,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:30:24,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:24,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:27,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:27,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:32,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:32,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:42,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... [2018-12-09 05:30:45,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:30:45,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:30:45,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:30:45,541 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:30:45,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:30:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:30:45,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:30:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:30:45,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:30:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:30:45,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:31:04,582 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:31:04,583 INFO L280 CfgBuilder]: Removed 198 assue(true) statements. [2018-12-09 05:31:04,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:04 BoogieIcfgContainer [2018-12-09 05:31:04,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:31:04,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:31:04,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:31:04,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:31:04,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:26:34" (1/3) ... [2018-12-09 05:31:04,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f7db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:04, skipping insertion in model container [2018-12-09 05:31:04,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:30:20" (2/3) ... [2018-12-09 05:31:04,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f7db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:04, skipping insertion in model container [2018-12-09 05:31:04,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:04" (3/3) ... [2018-12-09 05:31:04,588 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_cev_3_false-unreach-call.c [2018-12-09 05:31:04,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:31:04,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:31:04,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:31:04,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:31:04,646 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:31:04,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:31:04,646 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:31:04,646 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:31:04,647 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:31:04,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:31:04,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:31:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8328 states. [2018-12-09 05:31:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 05:31:04,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:04,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:04,709 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:04,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -770952620, now seen corresponding path program 1 times [2018-12-09 05:31:04,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:04,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:31:04,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:04,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 05:31:04,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:04,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 05:31:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 05:31:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:31:04,832 INFO L87 Difference]: Start difference. First operand 8328 states. Second operand 2 states. [2018-12-09 05:31:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:05,016 INFO L93 Difference]: Finished difference Result 14090 states and 28158 transitions. [2018-12-09 05:31:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 05:31:05,017 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-09 05:31:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:05,036 INFO L225 Difference]: With dead ends: 14090 [2018-12-09 05:31:05,036 INFO L226 Difference]: Without dead ends: 5719 [2018-12-09 05:31:05,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 05:31:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2018-12-09 05:31:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5719. [2018-12-09 05:31:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2018-12-09 05:31:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 8504 transitions. [2018-12-09 05:31:05,144 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 8504 transitions. Word has length 13 [2018-12-09 05:31:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:05,145 INFO L480 AbstractCegarLoop]: Abstraction has 5719 states and 8504 transitions. [2018-12-09 05:31:05,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 05:31:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 8504 transitions. [2018-12-09 05:31:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 05:31:05,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:05,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:05,145 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:05,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1893520771, now seen corresponding path program 1 times [2018-12-09 05:31:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:31:05,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:05,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:05,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:05,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:05,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:05,178 INFO L87 Difference]: Start difference. First operand 5719 states and 8504 transitions. Second operand 3 states. [2018-12-09 05:31:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:05,444 INFO L93 Difference]: Finished difference Result 11435 states and 17006 transitions. [2018-12-09 05:31:05,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:05,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 05:31:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:05,455 INFO L225 Difference]: With dead ends: 11435 [2018-12-09 05:31:05,455 INFO L226 Difference]: Without dead ends: 5722 [2018-12-09 05:31:05,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5722 states. [2018-12-09 05:31:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5722 to 5722. [2018-12-09 05:31:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5722 states. [2018-12-09 05:31:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5722 states to 5722 states and 8507 transitions. [2018-12-09 05:31:05,520 INFO L78 Accepts]: Start accepts. Automaton has 5722 states and 8507 transitions. Word has length 14 [2018-12-09 05:31:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:05,520 INFO L480 AbstractCegarLoop]: Abstraction has 5722 states and 8507 transitions. [2018-12-09 05:31:05,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5722 states and 8507 transitions. [2018-12-09 05:31:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 05:31:05,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:05,521 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:05,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:05,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2046439319, now seen corresponding path program 1 times [2018-12-09 05:31:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:05,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:31:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:05,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:05,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:05,548 INFO L87 Difference]: Start difference. First operand 5722 states and 8507 transitions. Second operand 3 states. [2018-12-09 05:31:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:05,772 INFO L93 Difference]: Finished difference Result 11423 states and 16989 transitions. [2018-12-09 05:31:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:05,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 05:31:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:05,783 INFO L225 Difference]: With dead ends: 11423 [2018-12-09 05:31:05,783 INFO L226 Difference]: Without dead ends: 5708 [2018-12-09 05:31:05,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2018-12-09 05:31:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5708. [2018-12-09 05:31:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-12-09 05:31:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 8487 transitions. [2018-12-09 05:31:05,848 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 8487 transitions. Word has length 19 [2018-12-09 05:31:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:05,848 INFO L480 AbstractCegarLoop]: Abstraction has 5708 states and 8487 transitions. [2018-12-09 05:31:05,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 8487 transitions. [2018-12-09 05:31:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 05:31:05,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:05,849 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:05,849 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1684101291, now seen corresponding path program 1 times [2018-12-09 05:31:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:05,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:05,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:05,884 INFO L87 Difference]: Start difference. First operand 5708 states and 8487 transitions. Second operand 3 states. [2018-12-09 05:31:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:06,327 INFO L93 Difference]: Finished difference Result 17090 states and 25425 transitions. [2018-12-09 05:31:06,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:06,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 05:31:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:06,348 INFO L225 Difference]: With dead ends: 17090 [2018-12-09 05:31:06,348 INFO L226 Difference]: Without dead ends: 11382 [2018-12-09 05:31:06,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11382 states. [2018-12-09 05:31:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11382 to 11308. [2018-12-09 05:31:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11308 states. [2018-12-09 05:31:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 16835 transitions. [2018-12-09 05:31:06,472 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 16835 transitions. Word has length 22 [2018-12-09 05:31:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:06,472 INFO L480 AbstractCegarLoop]: Abstraction has 11308 states and 16835 transitions. [2018-12-09 05:31:06,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 16835 transitions. [2018-12-09 05:31:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 05:31:06,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:06,473 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:06,473 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:06,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1515733990, now seen corresponding path program 1 times [2018-12-09 05:31:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:06,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:31:06,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:06,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:06,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:06,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:06,496 INFO L87 Difference]: Start difference. First operand 11308 states and 16835 transitions. Second operand 3 states. [2018-12-09 05:31:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:06,742 INFO L93 Difference]: Finished difference Result 22614 states and 33668 transitions. [2018-12-09 05:31:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:06,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 05:31:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:06,765 INFO L225 Difference]: With dead ends: 22614 [2018-12-09 05:31:06,765 INFO L226 Difference]: Without dead ends: 11318 [2018-12-09 05:31:06,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11318 states. [2018-12-09 05:31:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11318 to 11316. [2018-12-09 05:31:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2018-12-09 05:31:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 16843 transitions. [2018-12-09 05:31:06,894 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 16843 transitions. Word has length 25 [2018-12-09 05:31:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:06,894 INFO L480 AbstractCegarLoop]: Abstraction has 11316 states and 16843 transitions. [2018-12-09 05:31:06,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 16843 transitions. [2018-12-09 05:31:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 05:31:06,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:06,895 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:06,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:06,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1419393082, now seen corresponding path program 1 times [2018-12-09 05:31:06,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:06,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:06,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:06,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:06,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:06,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:06,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:06,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:06,920 INFO L87 Difference]: Start difference. First operand 11316 states and 16843 transitions. Second operand 3 states. [2018-12-09 05:31:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:07,128 INFO L93 Difference]: Finished difference Result 22632 states and 33688 transitions. [2018-12-09 05:31:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:07,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 05:31:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:07,152 INFO L225 Difference]: With dead ends: 22632 [2018-12-09 05:31:07,152 INFO L226 Difference]: Without dead ends: 11328 [2018-12-09 05:31:07,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11328 states. [2018-12-09 05:31:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11328 to 11326. [2018-12-09 05:31:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11326 states. [2018-12-09 05:31:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11326 states to 11326 states and 16853 transitions. [2018-12-09 05:31:07,275 INFO L78 Accepts]: Start accepts. Automaton has 11326 states and 16853 transitions. Word has length 33 [2018-12-09 05:31:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:07,275 INFO L480 AbstractCegarLoop]: Abstraction has 11326 states and 16853 transitions. [2018-12-09 05:31:07,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11326 states and 16853 transitions. [2018-12-09 05:31:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 05:31:07,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:07,279 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:07,279 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:07,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1417416212, now seen corresponding path program 1 times [2018-12-09 05:31:07,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:07,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:07,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:07,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:07,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:07,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:07,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:07,417 INFO L87 Difference]: Start difference. First operand 11326 states and 16853 transitions. Second operand 3 states. [2018-12-09 05:31:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:07,631 INFO L93 Difference]: Finished difference Result 11899 states and 17698 transitions. [2018-12-09 05:31:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:07,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-09 05:31:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:07,646 INFO L225 Difference]: With dead ends: 11899 [2018-12-09 05:31:07,646 INFO L226 Difference]: Without dead ends: 11893 [2018-12-09 05:31:07,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2018-12-09 05:31:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 11885. [2018-12-09 05:31:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11885 states. [2018-12-09 05:31:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 17684 transitions. [2018-12-09 05:31:07,769 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 17684 transitions. Word has length 285 [2018-12-09 05:31:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:07,769 INFO L480 AbstractCegarLoop]: Abstraction has 11885 states and 17684 transitions. [2018-12-09 05:31:07,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 17684 transitions. [2018-12-09 05:31:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 05:31:07,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:07,772 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:07,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:07,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1000488044, now seen corresponding path program 1 times [2018-12-09 05:31:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:07,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:07,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:07,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:07,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:07,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:07,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:07,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:07,913 INFO L87 Difference]: Start difference. First operand 11885 states and 17684 transitions. Second operand 3 states. [2018-12-09 05:31:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:08,341 INFO L93 Difference]: Finished difference Result 34503 states and 51354 transitions. [2018-12-09 05:31:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:08,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-09 05:31:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:08,357 INFO L225 Difference]: With dead ends: 34503 [2018-12-09 05:31:08,357 INFO L226 Difference]: Without dead ends: 23189 [2018-12-09 05:31:08,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23189 states. [2018-12-09 05:31:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23189 to 23119. [2018-12-09 05:31:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23119 states. [2018-12-09 05:31:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23119 states to 23119 states and 34417 transitions. [2018-12-09 05:31:08,555 INFO L78 Accepts]: Start accepts. Automaton has 23119 states and 34417 transitions. Word has length 286 [2018-12-09 05:31:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:08,556 INFO L480 AbstractCegarLoop]: Abstraction has 23119 states and 34417 transitions. [2018-12-09 05:31:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23119 states and 34417 transitions. [2018-12-09 05:31:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-09 05:31:08,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:08,559 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:08,559 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:08,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:08,559 INFO L82 PathProgramCache]: Analyzing trace with hash -142740232, now seen corresponding path program 1 times [2018-12-09 05:31:08,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:08,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:08,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:08,648 INFO L87 Difference]: Start difference. First operand 23119 states and 34417 transitions. Second operand 3 states. [2018-12-09 05:31:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:08,944 INFO L93 Difference]: Finished difference Result 45663 states and 67987 transitions. [2018-12-09 05:31:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:08,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-12-09 05:31:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:08,963 INFO L225 Difference]: With dead ends: 45663 [2018-12-09 05:31:08,964 INFO L226 Difference]: Without dead ends: 23115 [2018-12-09 05:31:08,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2018-12-09 05:31:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 23109. [2018-12-09 05:31:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2018-12-09 05:31:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 34388 transitions. [2018-12-09 05:31:09,187 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 34388 transitions. Word has length 294 [2018-12-09 05:31:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:09,187 INFO L480 AbstractCegarLoop]: Abstraction has 23109 states and 34388 transitions. [2018-12-09 05:31:09,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 34388 transitions. [2018-12-09 05:31:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-09 05:31:09,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:09,192 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:09,192 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:09,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -187281785, now seen corresponding path program 1 times [2018-12-09 05:31:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:09,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:31:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:09,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:09,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:09,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:09,259 INFO L87 Difference]: Start difference. First operand 23109 states and 34388 transitions. Second operand 3 states. [2018-12-09 05:31:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:09,478 INFO L93 Difference]: Finished difference Result 42289 states and 62938 transitions. [2018-12-09 05:31:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:09,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-12-09 05:31:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:09,493 INFO L225 Difference]: With dead ends: 42289 [2018-12-09 05:31:09,493 INFO L226 Difference]: Without dead ends: 19751 [2018-12-09 05:31:09,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19751 states. [2018-12-09 05:31:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19751 to 19749. [2018-12-09 05:31:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19749 states. [2018-12-09 05:31:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19749 states to 19749 states and 29380 transitions. [2018-12-09 05:31:09,642 INFO L78 Accepts]: Start accepts. Automaton has 19749 states and 29380 transitions. Word has length 303 [2018-12-09 05:31:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:09,643 INFO L480 AbstractCegarLoop]: Abstraction has 19749 states and 29380 transitions. [2018-12-09 05:31:09,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19749 states and 29380 transitions. [2018-12-09 05:31:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-09 05:31:09,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:09,646 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:09,646 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:09,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1611280910, now seen corresponding path program 1 times [2018-12-09 05:31:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:09,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:09,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:09,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:09,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:09,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:09,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:09,708 INFO L87 Difference]: Start difference. First operand 19749 states and 29380 transitions. Second operand 3 states. [2018-12-09 05:31:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:09,911 INFO L93 Difference]: Finished difference Result 38358 states and 57067 transitions. [2018-12-09 05:31:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:09,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-12-09 05:31:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:09,926 INFO L225 Difference]: With dead ends: 38358 [2018-12-09 05:31:09,926 INFO L226 Difference]: Without dead ends: 19180 [2018-12-09 05:31:09,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19180 states. [2018-12-09 05:31:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19180 to 19178. [2018-12-09 05:31:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19178 states. [2018-12-09 05:31:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19178 states to 19178 states and 28526 transitions. [2018-12-09 05:31:10,071 INFO L78 Accepts]: Start accepts. Automaton has 19178 states and 28526 transitions. Word has length 304 [2018-12-09 05:31:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:10,072 INFO L480 AbstractCegarLoop]: Abstraction has 19178 states and 28526 transitions. [2018-12-09 05:31:10,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19178 states and 28526 transitions. [2018-12-09 05:31:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-09 05:31:10,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:10,074 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:10,074 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:10,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 864354122, now seen corresponding path program 1 times [2018-12-09 05:31:10,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:10,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:31:10,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:10,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:31:10,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:31:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:31:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:31:10,601 INFO L87 Difference]: Start difference. First operand 19178 states and 28526 transitions. Second operand 4 states. [2018-12-09 05:31:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:10,867 INFO L93 Difference]: Finished difference Result 20322 states and 30216 transitions. [2018-12-09 05:31:10,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:31:10,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-12-09 05:31:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:10,883 INFO L225 Difference]: With dead ends: 20322 [2018-12-09 05:31:10,883 INFO L226 Difference]: Without dead ends: 20320 [2018-12-09 05:31:10,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:31:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20320 states. [2018-12-09 05:31:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20320 to 20310. [2018-12-09 05:31:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20310 states. [2018-12-09 05:31:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20310 states to 20310 states and 30205 transitions. [2018-12-09 05:31:11,033 INFO L78 Accepts]: Start accepts. Automaton has 20310 states and 30205 transitions. Word has length 304 [2018-12-09 05:31:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:11,033 INFO L480 AbstractCegarLoop]: Abstraction has 20310 states and 30205 transitions. [2018-12-09 05:31:11,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:31:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20310 states and 30205 transitions. [2018-12-09 05:31:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-12-09 05:31:11,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:11,036 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:11,036 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:11,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -181981046, now seen corresponding path program 1 times [2018-12-09 05:31:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:11,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:31:11,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:11,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:11,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:11,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:11,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:11,112 INFO L87 Difference]: Start difference. First operand 20310 states and 30205 transitions. Second operand 3 states. [2018-12-09 05:31:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:11,433 INFO L93 Difference]: Finished difference Result 38422 states and 57123 transitions. [2018-12-09 05:31:11,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:11,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-12-09 05:31:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:11,450 INFO L225 Difference]: With dead ends: 38422 [2018-12-09 05:31:11,450 INFO L226 Difference]: Without dead ends: 20380 [2018-12-09 05:31:11,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2018-12-09 05:31:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 20314. [2018-12-09 05:31:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20314 states. [2018-12-09 05:31:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20314 states to 20314 states and 30189 transitions. [2018-12-09 05:31:11,606 INFO L78 Accepts]: Start accepts. Automaton has 20314 states and 30189 transitions. Word has length 306 [2018-12-09 05:31:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:11,607 INFO L480 AbstractCegarLoop]: Abstraction has 20314 states and 30189 transitions. [2018-12-09 05:31:11,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20314 states and 30189 transitions. [2018-12-09 05:31:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-09 05:31:11,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:11,610 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:11,610 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:11,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2025333180, now seen corresponding path program 1 times [2018-12-09 05:31:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:11,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:31:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:11,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:11,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:11,697 INFO L87 Difference]: Start difference. First operand 20314 states and 30189 transitions. Second operand 3 states. [2018-12-09 05:31:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:11,906 INFO L93 Difference]: Finished difference Result 38378 states and 57039 transitions. [2018-12-09 05:31:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:11,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-12-09 05:31:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:11,927 INFO L225 Difference]: With dead ends: 38378 [2018-12-09 05:31:11,927 INFO L226 Difference]: Without dead ends: 20344 [2018-12-09 05:31:11,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20344 states. [2018-12-09 05:31:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20344 to 20342. [2018-12-09 05:31:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20342 states. [2018-12-09 05:31:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20342 states to 20342 states and 30217 transitions. [2018-12-09 05:31:12,106 INFO L78 Accepts]: Start accepts. Automaton has 20342 states and 30217 transitions. Word has length 307 [2018-12-09 05:31:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:12,107 INFO L480 AbstractCegarLoop]: Abstraction has 20342 states and 30217 transitions. [2018-12-09 05:31:12,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20342 states and 30217 transitions. [2018-12-09 05:31:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-12-09 05:31:12,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:12,109 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:12,109 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:12,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1492230436, now seen corresponding path program 1 times [2018-12-09 05:31:12,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:12,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:12,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:31:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:12,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:12,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:12,245 INFO L87 Difference]: Start difference. First operand 20342 states and 30217 transitions. Second operand 3 states. [2018-12-09 05:31:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:12,425 INFO L93 Difference]: Finished difference Result 36706 states and 54542 transitions. [2018-12-09 05:31:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:12,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2018-12-09 05:31:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:12,443 INFO L225 Difference]: With dead ends: 36706 [2018-12-09 05:31:12,443 INFO L226 Difference]: Without dead ends: 18644 [2018-12-09 05:31:12,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18644 states. [2018-12-09 05:31:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18644 to 18642. [2018-12-09 05:31:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18642 states. [2018-12-09 05:31:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18642 states to 18642 states and 27692 transitions. [2018-12-09 05:31:12,585 INFO L78 Accepts]: Start accepts. Automaton has 18642 states and 27692 transitions. Word has length 321 [2018-12-09 05:31:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:12,586 INFO L480 AbstractCegarLoop]: Abstraction has 18642 states and 27692 transitions. [2018-12-09 05:31:12,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 18642 states and 27692 transitions. [2018-12-09 05:31:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-09 05:31:12,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:12,587 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:12,588 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:12,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash 796115474, now seen corresponding path program 1 times [2018-12-09 05:31:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:12,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:12,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:12,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:12,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:31:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:12,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:12,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:12,653 INFO L87 Difference]: Start difference. First operand 18642 states and 27692 transitions. Second operand 3 states. [2018-12-09 05:31:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:12,873 INFO L93 Difference]: Finished difference Result 35062 states and 52093 transitions. [2018-12-09 05:31:12,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:12,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-12-09 05:31:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:12,892 INFO L225 Difference]: With dead ends: 35062 [2018-12-09 05:31:12,892 INFO L226 Difference]: Without dead ends: 18700 [2018-12-09 05:31:12,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2018-12-09 05:31:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 18698. [2018-12-09 05:31:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18698 states. [2018-12-09 05:31:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18698 states to 18698 states and 27752 transitions. [2018-12-09 05:31:13,043 INFO L78 Accepts]: Start accepts. Automaton has 18698 states and 27752 transitions. Word has length 323 [2018-12-09 05:31:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:13,044 INFO L480 AbstractCegarLoop]: Abstraction has 18698 states and 27752 transitions. [2018-12-09 05:31:13,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18698 states and 27752 transitions. [2018-12-09 05:31:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-09 05:31:13,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:13,046 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:13,046 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:13,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1451512681, now seen corresponding path program 1 times [2018-12-09 05:31:13,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:31:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:13,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:13,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:13,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:13,110 INFO L87 Difference]: Start difference. First operand 18698 states and 27752 transitions. Second operand 3 states. [2018-12-09 05:31:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:13,340 INFO L93 Difference]: Finished difference Result 35150 states and 52169 transitions. [2018-12-09 05:31:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:13,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-12-09 05:31:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:13,355 INFO L225 Difference]: With dead ends: 35150 [2018-12-09 05:31:13,355 INFO L226 Difference]: Without dead ends: 18732 [2018-12-09 05:31:13,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18732 states. [2018-12-09 05:31:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18732 to 18730. [2018-12-09 05:31:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18730 states. [2018-12-09 05:31:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18730 states to 18730 states and 27784 transitions. [2018-12-09 05:31:13,496 INFO L78 Accepts]: Start accepts. Automaton has 18730 states and 27784 transitions. Word has length 324 [2018-12-09 05:31:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:13,496 INFO L480 AbstractCegarLoop]: Abstraction has 18730 states and 27784 transitions. [2018-12-09 05:31:13,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18730 states and 27784 transitions. [2018-12-09 05:31:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-12-09 05:31:13,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:13,498 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:13,498 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:13,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:13,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1775568080, now seen corresponding path program 1 times [2018-12-09 05:31:13,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:31:13,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:13,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:13,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:13,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:13,576 INFO L87 Difference]: Start difference. First operand 18730 states and 27784 transitions. Second operand 3 states. [2018-12-09 05:31:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:13,777 INFO L93 Difference]: Finished difference Result 35218 states and 52241 transitions. [2018-12-09 05:31:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:13,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-12-09 05:31:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:13,791 INFO L225 Difference]: With dead ends: 35218 [2018-12-09 05:31:13,792 INFO L226 Difference]: Without dead ends: 18768 [2018-12-09 05:31:13,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2018-12-09 05:31:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 18766. [2018-12-09 05:31:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18766 states. [2018-12-09 05:31:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18766 states to 18766 states and 27820 transitions. [2018-12-09 05:31:13,937 INFO L78 Accepts]: Start accepts. Automaton has 18766 states and 27820 transitions. Word has length 341 [2018-12-09 05:31:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:13,937 INFO L480 AbstractCegarLoop]: Abstraction has 18766 states and 27820 transitions. [2018-12-09 05:31:13,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18766 states and 27820 transitions. [2018-12-09 05:31:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-12-09 05:31:13,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:13,942 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:13,942 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:13,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1484995658, now seen corresponding path program 1 times [2018-12-09 05:31:13,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:13,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:31:14,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:14,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:14,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:14,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:14,182 INFO L87 Difference]: Start difference. First operand 18766 states and 27820 transitions. Second operand 3 states. [2018-12-09 05:31:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:14,416 INFO L93 Difference]: Finished difference Result 20496 states and 30369 transitions. [2018-12-09 05:31:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:14,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2018-12-09 05:31:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:14,431 INFO L225 Difference]: With dead ends: 20496 [2018-12-09 05:31:14,432 INFO L226 Difference]: Without dead ends: 20486 [2018-12-09 05:31:14,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2018-12-09 05:31:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20470. [2018-12-09 05:31:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20470 states. [2018-12-09 05:31:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20470 states to 20470 states and 30341 transitions. [2018-12-09 05:31:14,584 INFO L78 Accepts]: Start accepts. Automaton has 20470 states and 30341 transitions. Word has length 570 [2018-12-09 05:31:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 20470 states and 30341 transitions. [2018-12-09 05:31:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20470 states and 30341 transitions. [2018-12-09 05:31:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-12-09 05:31:14,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:14,591 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:14,591 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:14,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1199011790, now seen corresponding path program 1 times [2018-12-09 05:31:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:14,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:31:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:31:14,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:31:14,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:31:14,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:31:14,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:31:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:31:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:14,806 INFO L87 Difference]: Start difference. First operand 20470 states and 30341 transitions. Second operand 3 states. [2018-12-09 05:31:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:31:15,185 INFO L93 Difference]: Finished difference Result 57986 states and 85959 transitions. [2018-12-09 05:31:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:31:15,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2018-12-09 05:31:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:31:15,217 INFO L225 Difference]: With dead ends: 57986 [2018-12-09 05:31:15,217 INFO L226 Difference]: Without dead ends: 39784 [2018-12-09 05:31:15,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:31:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39784 states. [2018-12-09 05:31:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39784 to 39540. [2018-12-09 05:31:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39540 states. [2018-12-09 05:31:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39540 states to 39540 states and 58718 transitions. [2018-12-09 05:31:15,526 INFO L78 Accepts]: Start accepts. Automaton has 39540 states and 58718 transitions. Word has length 576 [2018-12-09 05:31:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:31:15,526 INFO L480 AbstractCegarLoop]: Abstraction has 39540 states and 58718 transitions. [2018-12-09 05:31:15,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:31:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39540 states and 58718 transitions. [2018-12-09 05:31:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-12-09 05:31:15,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:31:15,532 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:31:15,533 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:31:15,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:31:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2132248318, now seen corresponding path program 1 times [2018-12-09 05:31:15,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:31:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:31:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:31:15,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:31:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:31:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:31:15,865 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:31:16,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:31:16 BoogieIcfgContainer [2018-12-09 05:31:16,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:31:16,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:31:16,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:31:16,029 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:31:16,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:04" (3/4) ... [2018-12-09 05:31:16,031 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:31:16,140 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9fa0e08e-223a-4d87-85f6-fe01c31cf34b/bin-2019/utaipan/witness.graphml [2018-12-09 05:31:16,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:31:16,141 INFO L168 Benchmark]: Toolchain (without parser) took 282005.95 ms. Allocated memory was 2.5 GB in the beginning and 11.2 GB in the end (delta: 8.7 GB). Free memory was 876.9 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,142 INFO L168 Benchmark]: CDTParser took 0.13 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-09 05:31:16,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226752.30 ms. Allocated memory was 2.5 GB in the beginning and 11.5 GB in the end (delta: 8.9 GB). Free memory was 876.9 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 8.0 GB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 3543.89 ms. Allocated memory is still 11.5 GB. Free memory was 3.8 GB in the beginning and 4.2 GB in the end (delta: -408.0 MB). Peak memory consumption was 642.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,142 INFO L168 Benchmark]: Boogie Preprocessor took 21107.22 ms. Allocated memory is still 11.5 GB. Free memory was 4.2 GB in the beginning and 4.5 GB in the end (delta: -270.3 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,142 INFO L168 Benchmark]: RCFGBuilder took 19042.67 ms. Allocated memory was 11.5 GB in the beginning and 11.4 GB in the end (delta: -23.1 MB). Free memory was 4.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,142 INFO L168 Benchmark]: TraceAbstraction took 11445.04 ms. Allocated memory was 11.4 GB in the beginning and 11.2 GB in the end (delta: -258.5 MB). Free memory was 3.0 GB in the beginning and 4.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,143 INFO L168 Benchmark]: Witness Printer took 111.52 ms. Allocated memory is still 11.2 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 05:31:16,144 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226752.30 ms. Allocated memory was 2.5 GB in the beginning and 11.5 GB in the end (delta: 8.9 GB). Free memory was 876.9 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 8.0 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 3543.89 ms. Allocated memory is still 11.5 GB. Free memory was 3.8 GB in the beginning and 4.2 GB in the end (delta: -408.0 MB). Peak memory consumption was 642.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21107.22 ms. Allocated memory is still 11.5 GB. Free memory was 4.2 GB in the beginning and 4.5 GB in the end (delta: -270.3 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * RCFGBuilder took 19042.67 ms. Allocated memory was 11.5 GB in the beginning and 11.4 GB in the end (delta: -23.1 MB). Free memory was 4.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * TraceAbstraction took 11445.04 ms. Allocated memory was 11.4 GB in the beginning and 11.2 GB in the end (delta: -258.5 MB). Free memory was 3.0 GB in the beginning and 4.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. * Witness Printer took 111.52 ms. Allocated memory is still 11.2 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44380]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_stage2Separation = 1; [L6] int m_completion = 2; [L7] int m_tliBurn = 3; [L8] int m_loiBurn = 4; [L9] int m_stage1Separation = 5; [L10] int m_edsSeparation = 6; [L11] int m_lsamAscentRendezvous = 7; [L12] int m_smSeparation = 8; [L13] int m_eiBurn = 9; [L14] int m_lsamRendezvous = 10; [L15] int m_teiBurn = 11; [L16] int m_CEV = 12; [L17] int m_abort = 13; [L18] int m_enterOrbitOps = 14; [L19] int m_failure = 15; [L20] int m_lsamSeparation = 16; [L21] int m_abortPassiveLAScompletion = 17; [L22] int m_lasJettison = 18; [L23] int m_lsamAscentBurn = 19; [L24] int m_srbIgnition = 20; [L25] int m_deOrbit = 21; VAL [\old(m_abort)=9, \old(m_abortPassiveLAScompletion)=11, \old(m_CEV)=10, \old(m_completion)=2, \old(m_deOrbit)=3, \old(m_edsSeparation)=5, \old(m_eiBurn)=7, \old(m_enterOrbitOps)=15, \old(m_failure)=12, \old(m_lasJettison)=4, \old(m_loiBurn)=13, \old(m_lsamAscentBurn)=19, \old(m_lsamAscentRendezvous)=6, \old(m_lsamRendezvous)=14, \old(m_lsamSeparation)=17, \old(m_smSeparation)=8, \old(m_srbIgnition)=16, \old(m_stage1Separation)=21, \old(m_stage2Separation)=22, \old(m_teiBurn)=20, \old(m_tliBurn)=18, m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3] [L30] int q = 0; [L31] int method_id; [L34] int this_spacecraft_cLSAM_ASCENT = 0; [L35] int this_spacecraft_cEDS = 0; [L36] int this_spacecraft_cLSAM_DESCENT = 0; [L37] int this_spacecraft_cLAS = 1; [L38] int this_spacecraft_cStage1 = 1; [L39] int this_spacecraft_cStage2 = 1; [L40] int this_spacecraft_cCM = 1; [L41] int this_spacecraft_cSM = 1; VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND TRUE q == 0 [L56] COND TRUE __VERIFIER_nondet_int() [L60] method_id = 12 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L62] COND FALSE !(0) [L66] q = 2 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND TRUE __VERIFIER_nondet_int() [L291] method_id = 8 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L293] COND FALSE !(0) [L297] q = 2 [L299] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L299] this_spacecraft_cCM=this_spacecraft_cCM [L299] this_spacecraft_cSM=0 [L299] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L299] this_spacecraft_cEDS=this_spacecraft_cEDS [L299] this_spacecraft_cLAS=this_spacecraft_cLAS [L299] this_spacecraft_cStage2=this_spacecraft_cStage2 [L299] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND FALSE !(__VERIFIER_nondet_int()) [L303] COND FALSE !(__VERIFIER_nondet_int()) [L319] COND FALSE !(__VERIFIER_nondet_int()) [L335] COND FALSE !(__VERIFIER_nondet_int()) [L351] COND FALSE !(__VERIFIER_nondet_int()) [L367] COND FALSE !(__VERIFIER_nondet_int()) [L383] COND FALSE !(__VERIFIER_nondet_int()) [L399] COND FALSE !(__VERIFIER_nondet_int()) [L415] COND FALSE !(__VERIFIER_nondet_int()) [L431] COND FALSE !(__VERIFIER_nondet_int()) [L447] COND FALSE !(__VERIFIER_nondet_int()) [L463] COND FALSE !(__VERIFIER_nondet_int()) [L479] COND FALSE !(__VERIFIER_nondet_int()) [L495] COND FALSE !(__VERIFIER_nondet_int()) [L511] COND FALSE !(__VERIFIER_nondet_int()) [L527] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L559] COND FALSE !(__VERIFIER_nondet_int()) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L591] COND FALSE !(__VERIFIER_nondet_int()) [L607] COND FALSE !(__VERIFIER_nondet_int()) [L623] COND FALSE !(__VERIFIER_nondet_int()) [L639] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND FALSE !(__VERIFIER_nondet_int()) [L671] COND FALSE !(__VERIFIER_nondet_int()) [L687] COND FALSE !(__VERIFIER_nondet_int()) [L703] COND FALSE !(__VERIFIER_nondet_int()) [L719] COND FALSE !(__VERIFIER_nondet_int()) [L735] COND FALSE !(__VERIFIER_nondet_int()) [L751] COND FALSE !(__VERIFIER_nondet_int()) [L767] COND FALSE !(__VERIFIER_nondet_int()) [L783] COND FALSE !(__VERIFIER_nondet_int()) [L799] COND FALSE !(__VERIFIER_nondet_int()) [L815] COND FALSE !(__VERIFIER_nondet_int()) [L831] COND FALSE !(__VERIFIER_nondet_int()) [L847] COND FALSE !(__VERIFIER_nondet_int()) [L863] COND FALSE !(__VERIFIER_nondet_int()) [L879] COND FALSE !(__VERIFIER_nondet_int()) [L895] COND FALSE !(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L927] COND FALSE !(__VERIFIER_nondet_int()) [L943] COND FALSE !(__VERIFIER_nondet_int()) [L959] COND FALSE !(__VERIFIER_nondet_int()) [L975] COND FALSE !(__VERIFIER_nondet_int()) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1007] COND FALSE !(__VERIFIER_nondet_int()) [L1023] COND FALSE !(__VERIFIER_nondet_int()) [L1039] COND FALSE !(__VERIFIER_nondet_int()) [L1055] COND FALSE !(__VERIFIER_nondet_int()) [L1071] COND FALSE !(__VERIFIER_nondet_int()) [L1087] COND FALSE !(__VERIFIER_nondet_int()) [L1103] COND FALSE !(__VERIFIER_nondet_int()) [L1119] COND FALSE !(__VERIFIER_nondet_int()) [L1135] COND FALSE !(__VERIFIER_nondet_int()) [L1151] COND FALSE !(__VERIFIER_nondet_int()) [L1167] COND FALSE !(__VERIFIER_nondet_int()) [L1183] COND FALSE !(__VERIFIER_nondet_int()) [L1199] COND FALSE !(__VERIFIER_nondet_int()) [L1215] COND FALSE !(__VERIFIER_nondet_int()) [L1231] COND FALSE !(__VERIFIER_nondet_int()) [L1247] COND FALSE !(__VERIFIER_nondet_int()) [L1263] COND FALSE !(__VERIFIER_nondet_int()) [L1279] COND FALSE !(__VERIFIER_nondet_int()) [L1295] COND FALSE !(__VERIFIER_nondet_int()) [L1311] COND FALSE !(__VERIFIER_nondet_int()) [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1343] COND FALSE !(__VERIFIER_nondet_int()) [L1359] COND FALSE !(__VERIFIER_nondet_int()) [L1375] COND FALSE !(__VERIFIER_nondet_int()) [L1391] COND FALSE !(__VERIFIER_nondet_int()) [L1407] COND FALSE !(__VERIFIER_nondet_int()) [L1423] COND FALSE !(__VERIFIER_nondet_int()) [L1439] COND FALSE !(__VERIFIER_nondet_int()) [L1455] COND FALSE !(__VERIFIER_nondet_int()) [L1471] COND FALSE !(__VERIFIER_nondet_int()) [L1487] COND FALSE !(__VERIFIER_nondet_int()) [L1503] COND FALSE !(__VERIFIER_nondet_int()) [L1519] COND FALSE !(__VERIFIER_nondet_int()) [L1535] COND FALSE !(__VERIFIER_nondet_int()) [L1551] COND FALSE !(__VERIFIER_nondet_int()) [L1567] COND FALSE !(__VERIFIER_nondet_int()) [L1583] COND FALSE !(__VERIFIER_nondet_int()) [L1599] COND FALSE !(__VERIFIER_nondet_int()) [L1615] COND FALSE !(__VERIFIER_nondet_int()) [L1631] COND FALSE !(__VERIFIER_nondet_int()) [L1647] COND FALSE !(__VERIFIER_nondet_int()) [L1663] COND FALSE !(__VERIFIER_nondet_int()) [L1679] COND FALSE !(__VERIFIER_nondet_int()) [L1695] COND FALSE !(__VERIFIER_nondet_int()) [L1711] COND FALSE !(__VERIFIER_nondet_int()) [L1727] COND FALSE !(__VERIFIER_nondet_int()) [L1743] COND FALSE !(__VERIFIER_nondet_int()) [L1759] COND FALSE !(__VERIFIER_nondet_int()) [L1775] COND FALSE !(__VERIFIER_nondet_int()) [L1791] COND FALSE !(__VERIFIER_nondet_int()) [L1807] COND FALSE !(__VERIFIER_nondet_int()) [L1823] COND FALSE !(__VERIFIER_nondet_int()) [L1839] COND FALSE !(__VERIFIER_nondet_int()) [L1855] COND FALSE !(__VERIFIER_nondet_int()) [L1871] COND FALSE !(__VERIFIER_nondet_int()) [L1887] COND FALSE !(__VERIFIER_nondet_int()) [L1903] COND FALSE !(__VERIFIER_nondet_int()) [L1919] COND FALSE !(__VERIFIER_nondet_int()) [L1935] COND FALSE !(__VERIFIER_nondet_int()) [L1951] COND FALSE !(__VERIFIER_nondet_int()) [L1967] COND FALSE !(__VERIFIER_nondet_int()) [L1983] COND FALSE !(__VERIFIER_nondet_int()) [L1999] COND FALSE !(__VERIFIER_nondet_int()) [L2015] COND FALSE !(__VERIFIER_nondet_int()) [L2031] COND FALSE !(__VERIFIER_nondet_int()) [L2047] COND FALSE !(__VERIFIER_nondet_int()) [L2063] COND FALSE !(__VERIFIER_nondet_int()) [L2079] COND FALSE !(__VERIFIER_nondet_int()) [L2095] COND FALSE !(__VERIFIER_nondet_int()) [L2111] COND FALSE !(__VERIFIER_nondet_int()) [L2127] COND FALSE !(__VERIFIER_nondet_int()) [L2143] COND FALSE !(__VERIFIER_nondet_int()) [L2159] COND FALSE !(__VERIFIER_nondet_int()) [L2175] COND FALSE !(__VERIFIER_nondet_int()) [L2191] COND FALSE !(__VERIFIER_nondet_int()) [L2207] COND FALSE !(__VERIFIER_nondet_int()) [L2223] COND FALSE !(__VERIFIER_nondet_int()) [L2239] COND FALSE !(__VERIFIER_nondet_int()) [L2255] COND FALSE !(__VERIFIER_nondet_int()) [L2271] COND FALSE !(__VERIFIER_nondet_int()) [L2287] COND FALSE !(__VERIFIER_nondet_int()) [L2303] COND FALSE !(__VERIFIER_nondet_int()) [L2319] COND FALSE !(__VERIFIER_nondet_int()) [L2335] COND FALSE !(__VERIFIER_nondet_int()) [L2351] COND FALSE !(__VERIFIER_nondet_int()) [L2367] COND FALSE !(__VERIFIER_nondet_int()) [L2383] COND FALSE !(__VERIFIER_nondet_int()) [L2399] COND FALSE !(__VERIFIER_nondet_int()) [L2415] COND FALSE !(__VERIFIER_nondet_int()) [L2431] COND FALSE !(__VERIFIER_nondet_int()) [L2447] COND FALSE !(__VERIFIER_nondet_int()) [L2463] COND FALSE !(__VERIFIER_nondet_int()) [L2479] COND FALSE !(__VERIFIER_nondet_int()) [L2495] COND FALSE !(__VERIFIER_nondet_int()) [L2511] COND FALSE !(__VERIFIER_nondet_int()) [L2527] COND FALSE !(__VERIFIER_nondet_int()) [L2543] COND FALSE !(__VERIFIER_nondet_int()) [L2559] COND FALSE !(__VERIFIER_nondet_int()) [L2575] COND FALSE !(__VERIFIER_nondet_int()) [L2591] COND FALSE !(__VERIFIER_nondet_int()) [L2607] COND FALSE !(__VERIFIER_nondet_int()) [L2623] COND FALSE !(__VERIFIER_nondet_int()) [L2639] COND FALSE !(__VERIFIER_nondet_int()) [L2655] COND FALSE !(__VERIFIER_nondet_int()) [L2671] COND FALSE !(__VERIFIER_nondet_int()) [L2687] COND FALSE !(__VERIFIER_nondet_int()) [L2703] COND FALSE !(__VERIFIER_nondet_int()) [L2719] COND FALSE !(__VERIFIER_nondet_int()) [L2735] COND FALSE !(__VERIFIER_nondet_int()) [L2751] COND FALSE !(__VERIFIER_nondet_int()) [L2767] COND FALSE !(__VERIFIER_nondet_int()) [L2783] COND FALSE !(__VERIFIER_nondet_int()) [L2799] COND FALSE !(__VERIFIER_nondet_int()) [L2815] COND FALSE !(__VERIFIER_nondet_int()) [L2831] COND FALSE !(__VERIFIER_nondet_int()) [L2847] COND FALSE !(__VERIFIER_nondet_int()) [L2863] COND FALSE !(__VERIFIER_nondet_int()) [L2879] COND FALSE !(__VERIFIER_nondet_int()) [L2895] COND FALSE !(__VERIFIER_nondet_int()) [L2911] COND FALSE !(__VERIFIER_nondet_int()) [L2927] COND FALSE !(__VERIFIER_nondet_int()) [L2943] COND FALSE !(__VERIFIER_nondet_int()) [L2959] COND FALSE !(__VERIFIER_nondet_int()) [L2975] COND FALSE !(__VERIFIER_nondet_int()) [L2991] COND FALSE !(__VERIFIER_nondet_int()) [L3007] COND FALSE !(__VERIFIER_nondet_int()) [L3023] COND FALSE !(__VERIFIER_nondet_int()) [L3039] COND FALSE !(__VERIFIER_nondet_int()) [L3055] COND FALSE !(__VERIFIER_nondet_int()) [L3071] COND FALSE !(__VERIFIER_nondet_int()) [L3087] COND FALSE !(__VERIFIER_nondet_int()) [L3103] COND FALSE !(__VERIFIER_nondet_int()) [L3119] COND FALSE !(__VERIFIER_nondet_int()) [L3135] COND FALSE !(__VERIFIER_nondet_int()) [L3151] COND FALSE !(__VERIFIER_nondet_int()) [L3167] COND FALSE !(__VERIFIER_nondet_int()) [L3183] COND FALSE !(__VERIFIER_nondet_int()) [L3199] COND FALSE !(__VERIFIER_nondet_int()) [L3215] COND FALSE !(__VERIFIER_nondet_int()) [L3231] COND FALSE !(__VERIFIER_nondet_int()) [L3247] COND FALSE !(__VERIFIER_nondet_int()) [L3263] COND FALSE !(__VERIFIER_nondet_int()) [L3279] COND FALSE !(__VERIFIER_nondet_int()) [L3295] COND FALSE !(__VERIFIER_nondet_int()) [L3311] COND FALSE !(__VERIFIER_nondet_int()) [L3327] COND FALSE !(__VERIFIER_nondet_int()) [L3343] COND FALSE !(__VERIFIER_nondet_int()) [L3359] COND FALSE !(__VERIFIER_nondet_int()) [L3375] COND FALSE !(__VERIFIER_nondet_int()) [L3391] COND FALSE !(__VERIFIER_nondet_int()) [L3407] COND FALSE !(__VERIFIER_nondet_int()) [L3423] COND FALSE !(__VERIFIER_nondet_int()) [L3439] COND FALSE !(__VERIFIER_nondet_int()) [L3455] COND FALSE !(__VERIFIER_nondet_int()) [L3471] COND FALSE !(__VERIFIER_nondet_int()) [L3487] COND FALSE !(__VERIFIER_nondet_int()) [L3503] COND FALSE !(__VERIFIER_nondet_int()) [L3519] COND FALSE !(__VERIFIER_nondet_int()) [L3535] COND FALSE !(__VERIFIER_nondet_int()) [L3551] COND FALSE !(__VERIFIER_nondet_int()) [L3567] COND FALSE !(__VERIFIER_nondet_int()) [L3583] COND FALSE !(__VERIFIER_nondet_int()) [L3599] COND FALSE !(__VERIFIER_nondet_int()) [L3615] COND FALSE !(__VERIFIER_nondet_int()) [L3631] COND FALSE !(__VERIFIER_nondet_int()) [L3647] COND FALSE !(__VERIFIER_nondet_int()) [L3663] COND FALSE !(__VERIFIER_nondet_int()) [L3679] COND FALSE !(__VERIFIER_nondet_int()) [L3695] COND FALSE !(__VERIFIER_nondet_int()) [L3711] COND FALSE !(__VERIFIER_nondet_int()) [L3727] COND FALSE !(__VERIFIER_nondet_int()) [L3743] COND FALSE !(__VERIFIER_nondet_int()) [L3759] COND FALSE !(__VERIFIER_nondet_int()) [L3775] COND FALSE !(__VERIFIER_nondet_int()) [L3791] COND FALSE !(__VERIFIER_nondet_int()) [L3807] COND FALSE !(__VERIFIER_nondet_int()) [L3823] COND FALSE !(__VERIFIER_nondet_int()) [L3839] COND FALSE !(__VERIFIER_nondet_int()) [L3855] COND FALSE !(__VERIFIER_nondet_int()) [L3871] COND FALSE !(__VERIFIER_nondet_int()) [L3887] COND FALSE !(__VERIFIER_nondet_int()) [L3903] COND FALSE !(__VERIFIER_nondet_int()) [L3919] COND FALSE !(__VERIFIER_nondet_int()) [L3935] COND FALSE !(__VERIFIER_nondet_int()) [L3951] COND FALSE !(__VERIFIER_nondet_int()) [L3967] COND FALSE !(__VERIFIER_nondet_int()) [L3983] COND FALSE !(__VERIFIER_nondet_int()) [L3999] COND FALSE !(__VERIFIER_nondet_int()) [L4015] COND FALSE !(__VERIFIER_nondet_int()) [L4031] COND FALSE !(__VERIFIER_nondet_int()) [L4047] COND FALSE !(__VERIFIER_nondet_int()) [L4063] COND FALSE !(__VERIFIER_nondet_int()) [L4079] COND FALSE !(__VERIFIER_nondet_int()) [L4095] COND FALSE !(__VERIFIER_nondet_int()) [L4111] COND FALSE !(__VERIFIER_nondet_int()) [L4127] COND FALSE !(__VERIFIER_nondet_int()) [L4143] COND FALSE !(__VERIFIER_nondet_int()) [L4159] COND FALSE !(__VERIFIER_nondet_int()) [L4175] COND FALSE !(__VERIFIER_nondet_int()) [L4191] COND FALSE !(__VERIFIER_nondet_int()) [L4207] COND FALSE !(__VERIFIER_nondet_int()) [L4223] COND FALSE !(__VERIFIER_nondet_int()) [L4239] COND FALSE !(__VERIFIER_nondet_int()) [L4255] COND FALSE !(__VERIFIER_nondet_int()) [L4271] COND FALSE !(__VERIFIER_nondet_int()) [L4287] COND FALSE !(__VERIFIER_nondet_int()) [L4303] COND FALSE !(__VERIFIER_nondet_int()) [L4319] COND FALSE !(__VERIFIER_nondet_int()) [L4335] COND FALSE !(__VERIFIER_nondet_int()) [L4351] COND FALSE !(__VERIFIER_nondet_int()) [L4367] COND FALSE !(__VERIFIER_nondet_int()) [L4383] COND FALSE !(__VERIFIER_nondet_int()) [L4399] COND FALSE !(__VERIFIER_nondet_int()) [L4415] COND FALSE !(__VERIFIER_nondet_int()) [L4431] COND FALSE !(__VERIFIER_nondet_int()) [L4447] COND FALSE !(__VERIFIER_nondet_int()) [L4463] COND FALSE !(__VERIFIER_nondet_int()) [L4479] COND FALSE !(__VERIFIER_nondet_int()) [L4495] COND FALSE !(__VERIFIER_nondet_int()) [L4511] COND FALSE !(__VERIFIER_nondet_int()) [L4527] COND TRUE __VERIFIER_nondet_int() [L4531] method_id = 18 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4533] COND FALSE !(0) [L4537] q = 4 [L4539] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L4539] this_spacecraft_cCM=this_spacecraft_cCM [L4539] this_spacecraft_cSM=this_spacecraft_cSM [L4539] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L4539] this_spacecraft_cEDS=this_spacecraft_cEDS [L4539] this_spacecraft_cLAS=0 [L4539] this_spacecraft_cStage2=this_spacecraft_cStage2 [L4539] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND FALSE !(q == 2) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4594] COND FALSE !(q == 3) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L9014] COND TRUE q == 4 [L9015] COND FALSE !(__VERIFIER_nondet_int()) [L9031] COND FALSE !(__VERIFIER_nondet_int()) [L9047] COND FALSE !(__VERIFIER_nondet_int()) [L9063] COND FALSE !(__VERIFIER_nondet_int()) [L9079] COND FALSE !(__VERIFIER_nondet_int()) [L9095] COND FALSE !(__VERIFIER_nondet_int()) [L9111] COND FALSE !(__VERIFIER_nondet_int()) [L9127] COND FALSE !(__VERIFIER_nondet_int()) [L9143] COND FALSE !(__VERIFIER_nondet_int()) [L9159] COND FALSE !(__VERIFIER_nondet_int()) [L9175] COND FALSE !(__VERIFIER_nondet_int()) [L9191] COND FALSE !(__VERIFIER_nondet_int()) [L9207] COND FALSE !(__VERIFIER_nondet_int()) [L9223] COND FALSE !(__VERIFIER_nondet_int()) [L9239] COND FALSE !(__VERIFIER_nondet_int()) [L9255] COND FALSE !(__VERIFIER_nondet_int()) [L9271] COND FALSE !(__VERIFIER_nondet_int()) [L9287] COND FALSE !(__VERIFIER_nondet_int()) [L9303] COND FALSE !(__VERIFIER_nondet_int()) [L9319] COND FALSE !(__VERIFIER_nondet_int()) [L9335] COND FALSE !(__VERIFIER_nondet_int()) [L9351] COND FALSE !(__VERIFIER_nondet_int()) [L9367] COND FALSE !(__VERIFIER_nondet_int()) [L9383] COND FALSE !(__VERIFIER_nondet_int()) [L9399] COND FALSE !(__VERIFIER_nondet_int()) [L9415] COND FALSE !(__VERIFIER_nondet_int()) [L9431] COND FALSE !(__VERIFIER_nondet_int()) [L9447] COND FALSE !(__VERIFIER_nondet_int()) [L9463] COND FALSE !(__VERIFIER_nondet_int()) [L9479] COND FALSE !(__VERIFIER_nondet_int()) [L9495] COND FALSE !(__VERIFIER_nondet_int()) [L9511] COND FALSE !(__VERIFIER_nondet_int()) [L9527] COND FALSE !(__VERIFIER_nondet_int()) [L9543] COND FALSE !(__VERIFIER_nondet_int()) [L9559] COND FALSE !(__VERIFIER_nondet_int()) [L9575] COND FALSE !(__VERIFIER_nondet_int()) [L9591] COND FALSE !(__VERIFIER_nondet_int()) [L9607] COND FALSE !(__VERIFIER_nondet_int()) [L9623] COND FALSE !(__VERIFIER_nondet_int()) [L9639] COND FALSE !(__VERIFIER_nondet_int()) [L9655] COND FALSE !(__VERIFIER_nondet_int()) [L9671] COND FALSE !(__VERIFIER_nondet_int()) [L9687] COND FALSE !(__VERIFIER_nondet_int()) [L9703] COND FALSE !(__VERIFIER_nondet_int()) [L9719] COND FALSE !(__VERIFIER_nondet_int()) [L9735] COND FALSE !(__VERIFIER_nondet_int()) [L9751] COND FALSE !(__VERIFIER_nondet_int()) [L9767] COND FALSE !(__VERIFIER_nondet_int()) [L9783] COND FALSE !(__VERIFIER_nondet_int()) [L9799] COND FALSE !(__VERIFIER_nondet_int()) [L9815] COND FALSE !(__VERIFIER_nondet_int()) [L9831] COND FALSE !(__VERIFIER_nondet_int()) [L9847] COND FALSE !(__VERIFIER_nondet_int()) [L9863] COND FALSE !(__VERIFIER_nondet_int()) [L9879] COND FALSE !(__VERIFIER_nondet_int()) [L9895] COND FALSE !(__VERIFIER_nondet_int()) [L9911] COND FALSE !(__VERIFIER_nondet_int()) [L9927] COND FALSE !(__VERIFIER_nondet_int()) [L9943] COND FALSE !(__VERIFIER_nondet_int()) [L9959] COND FALSE !(__VERIFIER_nondet_int()) [L9975] COND FALSE !(__VERIFIER_nondet_int()) [L9991] COND FALSE !(__VERIFIER_nondet_int()) [L10007] COND FALSE !(__VERIFIER_nondet_int()) [L10023] COND FALSE !(__VERIFIER_nondet_int()) [L10039] COND FALSE !(__VERIFIER_nondet_int()) [L10055] COND FALSE !(__VERIFIER_nondet_int()) [L10071] COND FALSE !(__VERIFIER_nondet_int()) [L10087] COND FALSE !(__VERIFIER_nondet_int()) [L10103] COND FALSE !(__VERIFIER_nondet_int()) [L10119] COND FALSE !(__VERIFIER_nondet_int()) [L10135] COND FALSE !(__VERIFIER_nondet_int()) [L10151] COND FALSE !(__VERIFIER_nondet_int()) [L10167] COND FALSE !(__VERIFIER_nondet_int()) [L10183] COND FALSE !(__VERIFIER_nondet_int()) [L10199] COND FALSE !(__VERIFIER_nondet_int()) [L10215] COND FALSE !(__VERIFIER_nondet_int()) [L10231] COND FALSE !(__VERIFIER_nondet_int()) [L10247] COND FALSE !(__VERIFIER_nondet_int()) [L10263] COND FALSE !(__VERIFIER_nondet_int()) [L10279] COND FALSE !(__VERIFIER_nondet_int()) [L10295] COND FALSE !(__VERIFIER_nondet_int()) [L10311] COND FALSE !(__VERIFIER_nondet_int()) [L10327] COND FALSE !(__VERIFIER_nondet_int()) [L10343] COND FALSE !(__VERIFIER_nondet_int()) [L10359] COND FALSE !(__VERIFIER_nondet_int()) [L10375] COND FALSE !(__VERIFIER_nondet_int()) [L10391] COND FALSE !(__VERIFIER_nondet_int()) [L10407] COND FALSE !(__VERIFIER_nondet_int()) [L10423] COND FALSE !(__VERIFIER_nondet_int()) [L10439] COND FALSE !(__VERIFIER_nondet_int()) [L10455] COND FALSE !(__VERIFIER_nondet_int()) [L10471] COND FALSE !(__VERIFIER_nondet_int()) [L10487] COND FALSE !(__VERIFIER_nondet_int()) [L10503] COND FALSE !(__VERIFIER_nondet_int()) [L10519] COND FALSE !(__VERIFIER_nondet_int()) [L10535] COND FALSE !(__VERIFIER_nondet_int()) [L10551] COND FALSE !(__VERIFIER_nondet_int()) [L10567] COND FALSE !(__VERIFIER_nondet_int()) [L10583] COND FALSE !(__VERIFIER_nondet_int()) [L10599] COND FALSE !(__VERIFIER_nondet_int()) [L10615] COND FALSE !(__VERIFIER_nondet_int()) [L10631] COND FALSE !(__VERIFIER_nondet_int()) [L10647] COND FALSE !(__VERIFIER_nondet_int()) [L10663] COND FALSE !(__VERIFIER_nondet_int()) [L10679] COND FALSE !(__VERIFIER_nondet_int()) [L10695] COND FALSE !(__VERIFIER_nondet_int()) [L10711] COND FALSE !(__VERIFIER_nondet_int()) [L10727] COND FALSE !(__VERIFIER_nondet_int()) [L10743] COND FALSE !(__VERIFIER_nondet_int()) [L10759] COND FALSE !(__VERIFIER_nondet_int()) [L10775] COND FALSE !(__VERIFIER_nondet_int()) [L10791] COND FALSE !(__VERIFIER_nondet_int()) [L10807] COND FALSE !(__VERIFIER_nondet_int()) [L10823] COND FALSE !(__VERIFIER_nondet_int()) [L10839] COND FALSE !(__VERIFIER_nondet_int()) [L10855] COND FALSE !(__VERIFIER_nondet_int()) [L10871] COND FALSE !(__VERIFIER_nondet_int()) [L10887] COND FALSE !(__VERIFIER_nondet_int()) [L10903] COND FALSE !(__VERIFIER_nondet_int()) [L10919] COND FALSE !(__VERIFIER_nondet_int()) [L10935] COND FALSE !(__VERIFIER_nondet_int()) [L10951] COND FALSE !(__VERIFIER_nondet_int()) [L10967] COND FALSE !(__VERIFIER_nondet_int()) [L10983] COND FALSE !(__VERIFIER_nondet_int()) [L10999] COND FALSE !(__VERIFIER_nondet_int()) [L11015] COND FALSE !(__VERIFIER_nondet_int()) [L11031] COND FALSE !(__VERIFIER_nondet_int()) [L11047] COND FALSE !(__VERIFIER_nondet_int()) [L11063] COND FALSE !(__VERIFIER_nondet_int()) [L11079] COND FALSE !(__VERIFIER_nondet_int()) [L11095] COND FALSE !(__VERIFIER_nondet_int()) [L11111] COND FALSE !(__VERIFIER_nondet_int()) [L11127] COND FALSE !(__VERIFIER_nondet_int()) [L11143] COND FALSE !(__VERIFIER_nondet_int()) [L11159] COND FALSE !(__VERIFIER_nondet_int()) [L11175] COND FALSE !(__VERIFIER_nondet_int()) [L11191] COND FALSE !(__VERIFIER_nondet_int()) [L11207] COND FALSE !(__VERIFIER_nondet_int()) [L11223] COND FALSE !(__VERIFIER_nondet_int()) [L11239] COND FALSE !(__VERIFIER_nondet_int()) [L11255] COND FALSE !(__VERIFIER_nondet_int()) [L11271] COND FALSE !(__VERIFIER_nondet_int()) [L11287] COND FALSE !(__VERIFIER_nondet_int()) [L11303] COND FALSE !(__VERIFIER_nondet_int()) [L11319] COND FALSE !(__VERIFIER_nondet_int()) [L11335] COND FALSE !(__VERIFIER_nondet_int()) [L11351] COND FALSE !(__VERIFIER_nondet_int()) [L11367] COND FALSE !(__VERIFIER_nondet_int()) [L11383] COND FALSE !(__VERIFIER_nondet_int()) [L11399] COND FALSE !(__VERIFIER_nondet_int()) [L11415] COND FALSE !(__VERIFIER_nondet_int()) [L11431] COND FALSE !(__VERIFIER_nondet_int()) [L11447] COND FALSE !(__VERIFIER_nondet_int()) [L11463] COND FALSE !(__VERIFIER_nondet_int()) [L11479] COND FALSE !(__VERIFIER_nondet_int()) [L11495] COND FALSE !(__VERIFIER_nondet_int()) [L11511] COND FALSE !(__VERIFIER_nondet_int()) [L11527] COND FALSE !(__VERIFIER_nondet_int()) [L11543] COND FALSE !(__VERIFIER_nondet_int()) [L11559] COND FALSE !(__VERIFIER_nondet_int()) [L11575] COND FALSE !(__VERIFIER_nondet_int()) [L11591] COND FALSE !(__VERIFIER_nondet_int()) [L11607] COND FALSE !(__VERIFIER_nondet_int()) [L11623] COND FALSE !(__VERIFIER_nondet_int()) [L11639] COND FALSE !(__VERIFIER_nondet_int()) [L11655] COND FALSE !(__VERIFIER_nondet_int()) [L11671] COND FALSE !(__VERIFIER_nondet_int()) [L11687] COND FALSE !(__VERIFIER_nondet_int()) [L11703] COND FALSE !(__VERIFIER_nondet_int()) [L11719] COND FALSE !(__VERIFIER_nondet_int()) [L11735] COND FALSE !(__VERIFIER_nondet_int()) [L11751] COND FALSE !(__VERIFIER_nondet_int()) [L11767] COND FALSE !(__VERIFIER_nondet_int()) [L11783] COND FALSE !(__VERIFIER_nondet_int()) [L11799] COND FALSE !(__VERIFIER_nondet_int()) [L11815] COND FALSE !(__VERIFIER_nondet_int()) [L11831] COND FALSE !(__VERIFIER_nondet_int()) [L11847] COND FALSE !(__VERIFIER_nondet_int()) [L11863] COND FALSE !(__VERIFIER_nondet_int()) [L11879] COND FALSE !(__VERIFIER_nondet_int()) [L11895] COND FALSE !(__VERIFIER_nondet_int()) [L11911] COND FALSE !(__VERIFIER_nondet_int()) [L11927] COND FALSE !(__VERIFIER_nondet_int()) [L11943] COND FALSE !(__VERIFIER_nondet_int()) [L11959] COND FALSE !(__VERIFIER_nondet_int()) [L11975] COND FALSE !(__VERIFIER_nondet_int()) [L11991] COND FALSE !(__VERIFIER_nondet_int()) [L12007] COND FALSE !(__VERIFIER_nondet_int()) [L12023] COND FALSE !(__VERIFIER_nondet_int()) [L12039] COND FALSE !(__VERIFIER_nondet_int()) [L12055] COND FALSE !(__VERIFIER_nondet_int()) [L12071] COND FALSE !(__VERIFIER_nondet_int()) [L12087] COND FALSE !(__VERIFIER_nondet_int()) [L12103] COND FALSE !(__VERIFIER_nondet_int()) [L12119] COND FALSE !(__VERIFIER_nondet_int()) [L12135] COND FALSE !(__VERIFIER_nondet_int()) [L12151] COND FALSE !(__VERIFIER_nondet_int()) [L12167] COND FALSE !(__VERIFIER_nondet_int()) [L12183] COND FALSE !(__VERIFIER_nondet_int()) [L12199] COND FALSE !(__VERIFIER_nondet_int()) [L12215] COND FALSE !(__VERIFIER_nondet_int()) [L12231] COND FALSE !(__VERIFIER_nondet_int()) [L12247] COND FALSE !(__VERIFIER_nondet_int()) [L12263] COND FALSE !(__VERIFIER_nondet_int()) [L12279] COND FALSE !(__VERIFIER_nondet_int()) [L12295] COND FALSE !(__VERIFIER_nondet_int()) [L12311] COND FALSE !(__VERIFIER_nondet_int()) [L12327] COND FALSE !(__VERIFIER_nondet_int()) [L12343] COND FALSE !(__VERIFIER_nondet_int()) [L12359] COND FALSE !(__VERIFIER_nondet_int()) [L12375] COND FALSE !(__VERIFIER_nondet_int()) [L12391] COND FALSE !(__VERIFIER_nondet_int()) [L12407] COND FALSE !(__VERIFIER_nondet_int()) [L12423] COND FALSE !(__VERIFIER_nondet_int()) [L12439] COND FALSE !(__VERIFIER_nondet_int()) [L12455] COND FALSE !(__VERIFIER_nondet_int()) [L12471] COND FALSE !(__VERIFIER_nondet_int()) [L12487] COND FALSE !(__VERIFIER_nondet_int()) [L12503] COND FALSE !(__VERIFIER_nondet_int()) [L12519] COND FALSE !(__VERIFIER_nondet_int()) [L12535] COND FALSE !(__VERIFIER_nondet_int()) [L12551] COND FALSE !(__VERIFIER_nondet_int()) [L12567] COND FALSE !(__VERIFIER_nondet_int()) [L12583] COND FALSE !(__VERIFIER_nondet_int()) [L12599] COND FALSE !(__VERIFIER_nondet_int()) [L12615] COND FALSE !(__VERIFIER_nondet_int()) [L12631] COND FALSE !(__VERIFIER_nondet_int()) [L12647] COND FALSE !(__VERIFIER_nondet_int()) [L12663] COND FALSE !(__VERIFIER_nondet_int()) [L12679] COND FALSE !(__VERIFIER_nondet_int()) [L12695] COND FALSE !(__VERIFIER_nondet_int()) [L12711] COND FALSE !(__VERIFIER_nondet_int()) [L12727] COND FALSE !(__VERIFIER_nondet_int()) [L12743] COND FALSE !(__VERIFIER_nondet_int()) [L12759] COND FALSE !(__VERIFIER_nondet_int()) [L12775] COND FALSE !(__VERIFIER_nondet_int()) [L12791] COND FALSE !(__VERIFIER_nondet_int()) [L12807] COND FALSE !(__VERIFIER_nondet_int()) [L12823] COND FALSE !(__VERIFIER_nondet_int()) [L12839] COND FALSE !(__VERIFIER_nondet_int()) [L12855] COND FALSE !(__VERIFIER_nondet_int()) [L12871] COND FALSE !(__VERIFIER_nondet_int()) [L12887] COND FALSE !(__VERIFIER_nondet_int()) [L12903] COND FALSE !(__VERIFIER_nondet_int()) [L12919] COND FALSE !(__VERIFIER_nondet_int()) [L12935] COND FALSE !(__VERIFIER_nondet_int()) [L12951] COND FALSE !(__VERIFIER_nondet_int()) [L12967] COND FALSE !(__VERIFIER_nondet_int()) [L12983] COND FALSE !(__VERIFIER_nondet_int()) [L12999] COND FALSE !(__VERIFIER_nondet_int()) [L13015] COND FALSE !(__VERIFIER_nondet_int()) [L13031] COND FALSE !(__VERIFIER_nondet_int()) [L13047] COND FALSE !(__VERIFIER_nondet_int()) [L13063] COND FALSE !(__VERIFIER_nondet_int()) [L13079] COND FALSE !(__VERIFIER_nondet_int()) [L13095] COND FALSE !(__VERIFIER_nondet_int()) [L13111] COND FALSE !(__VERIFIER_nondet_int()) [L13127] COND FALSE !(__VERIFIER_nondet_int()) [L13143] COND FALSE !(__VERIFIER_nondet_int()) [L13159] COND FALSE !(__VERIFIER_nondet_int()) [L13175] COND FALSE !(__VERIFIER_nondet_int()) [L13191] COND FALSE !(__VERIFIER_nondet_int()) [L13207] COND FALSE !(__VERIFIER_nondet_int()) [L13223] COND FALSE !(__VERIFIER_nondet_int()) [L13239] COND FALSE !(__VERIFIER_nondet_int()) [L13255] COND FALSE !(__VERIFIER_nondet_int()) [L13271] COND FALSE !(__VERIFIER_nondet_int()) [L13287] COND FALSE !(__VERIFIER_nondet_int()) [L13303] COND FALSE !(__VERIFIER_nondet_int()) [L13319] COND FALSE !(__VERIFIER_nondet_int()) [L13335] COND FALSE !(__VERIFIER_nondet_int()) [L13351] COND FALSE !(__VERIFIER_nondet_int()) [L13367] COND FALSE !(__VERIFIER_nondet_int()) [L13383] COND FALSE !(__VERIFIER_nondet_int()) [L13399] COND FALSE !(__VERIFIER_nondet_int()) [L13415] COND TRUE __VERIFIER_nondet_int() [L13419] method_id = 21 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L13421] COND TRUE (!this_spacecraft_cEDS && (!this_spacecraft_cLSAM_ASCENT && (!this_spacecraft_cSM && !this_spacecraft_cLAS))) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44380] __VERIFIER_error() VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 8328 locations, 1 error locations. UNSAFE Result, 11.3s OverallTime, 21 OverallIterations, 6 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 176918 SDtfs, 71005 SDslu, 124977 SDs, 0 SdLazy, 3644 SolverSat, 1384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39540occurred in iteration=20, 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: 2.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 512 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 5560 NumberOfCodeBlocks, 5560 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4950 ConstructedInterpolants, 0 QuantifiedInterpolants, 6145955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 304/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...