java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/psyco/psyco_cev_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:23:14,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:23:14,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:23:14,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:23:14,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:23:14,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:23:14,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:23:14,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:23:14,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:23:14,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:23:14,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:23:14,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:23:14,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:23:14,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:23:14,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:23:14,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:23:14,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:23:14,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:23:14,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:23:14,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:23:14,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:23:14,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:23:14,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:23:14,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:23:14,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:23:14,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:23:14,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:23:14,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:23:14,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:23:14,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:23:14,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:23:14,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:23:14,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:23:14,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:23:14,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:23:14,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:23:14,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:23:14,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:23:14,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:23:14,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:23:14,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:23:14,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:23:14,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:23:14,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:23:14,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:23:14,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:23:14,613 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:23:14,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:23:14,614 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:23:14,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:23:14,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:23:14,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:23:14,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:23:14,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:23:14,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:23:14,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:23:14,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:23:14,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:23:14,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:23:14,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:23:14,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:23:14,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:23:14,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:23:14,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:23:14,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:23:14,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:23:14,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:23:14,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:23:14,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:23:14,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:23:14,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:23:14,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:23:14,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:23:14,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:23:14,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:23:14,912 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:23:14,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_cev_1.c [2019-10-07 15:23:14,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754be159d/189228436cae474cad152125678f1ee9/FLAGb86df056d [2019-10-07 15:23:23,799 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:23:23,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_cev_1.c [2019-10-07 15:23:24,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754be159d/189228436cae474cad152125678f1ee9/FLAGb86df056d [2019-10-07 15:23:24,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754be159d/189228436cae474cad152125678f1ee9 [2019-10-07 15:23:24,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:23:24,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:23:24,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:23:24,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:23:24,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:23:24,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:24" (1/1) ... [2019-10-07 15:23:24,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a95ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:23:24, skipping insertion in model container [2019-10-07 15:23:24,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:23:24" (1/1) ... [2019-10-07 15:23:24,630 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:23:32,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:24:59,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:24:59,671 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:26:19,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:26:19,328 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:26:19,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19 WrapperNode [2019-10-07 15:26:19,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:26:19,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:26:19,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:26:19,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:26:19,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:19,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:23,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:23,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:43,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:43,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:47,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... [2019-10-07 15:26:49,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:26:49,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:26:49,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:26:49,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:26:49,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-07 15:26:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:26:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:26:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:26:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:26:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:26:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:26:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:26:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:27:15,971 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:27:15,971 INFO L284 CfgBuilder]: Removed 122 assume(true) statements. [2019-10-07 15:27:15,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:27:15 BoogieIcfgContainer [2019-10-07 15:27:15,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:27:15,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:27:15,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:27:15,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:27:15,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:23:24" (1/3) ... [2019-10-07 15:27:15,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238f6b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:27:15, skipping insertion in model container [2019-10-07 15:27:15,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:26:19" (2/3) ... [2019-10-07 15:27:15,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238f6b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:27:15, skipping insertion in model container [2019-10-07 15:27:15,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:27:15" (3/3) ... [2019-10-07 15:27:15,983 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_cev_1.c [2019-10-07 15:27:15,990 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:27:16,003 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:27:16,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:27:16,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:27:16,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:27:16,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:27:16,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:27:16,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:27:16,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:27:16,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:27:16,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:27:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5011 states. [2019-10-07 15:27:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 15:27:16,154 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:16,155 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:27:16,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1060938562, now seen corresponding path program 1 times [2019-10-07 15:27:16,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:16,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:16,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:16,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:27:16,354 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:16,355 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:16,355 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 15:27:16,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 15:27:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 15:27:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 15:27:16,374 INFO L87 Difference]: Start difference. First operand 5011 states. Second operand 2 states. [2019-10-07 15:27:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:16,551 INFO L93 Difference]: Finished difference Result 8481 states and 16941 transitions. [2019-10-07 15:27:16,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 15:27:16,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-07 15:27:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:16,591 INFO L225 Difference]: With dead ends: 8481 [2019-10-07 15:27:16,592 INFO L226 Difference]: Without dead ends: 3442 [2019-10-07 15:27:16,609 INFO L606 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 [2019-10-07 15:27:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2019-10-07 15:27:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3442. [2019-10-07 15:27:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-10-07 15:27:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5115 transitions. [2019-10-07 15:27:16,825 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5115 transitions. Word has length 12 [2019-10-07 15:27:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:16,825 INFO L462 AbstractCegarLoop]: Abstraction has 3442 states and 5115 transitions. [2019-10-07 15:27:16,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 15:27:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5115 transitions. [2019-10-07 15:27:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 15:27:16,828 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:16,828 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:27:16,829 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -938938937, now seen corresponding path program 1 times [2019-10-07 15:27:16,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:16,832 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:16,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:16,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:27:17,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:17,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:17,132 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:17,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:17,135 INFO L87 Difference]: Start difference. First operand 3442 states and 5115 transitions. Second operand 3 states. [2019-10-07 15:27:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:17,528 INFO L93 Difference]: Finished difference Result 6882 states and 10229 transitions. [2019-10-07 15:27:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:17,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 15:27:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:17,554 INFO L225 Difference]: With dead ends: 6882 [2019-10-07 15:27:17,554 INFO L226 Difference]: Without dead ends: 3445 [2019-10-07 15:27:17,563 INFO L606 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 [2019-10-07 15:27:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-10-07 15:27:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3445. [2019-10-07 15:27:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3445 states. [2019-10-07 15:27:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 5118 transitions. [2019-10-07 15:27:17,652 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 5118 transitions. Word has length 13 [2019-10-07 15:27:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:17,652 INFO L462 AbstractCegarLoop]: Abstraction has 3445 states and 5118 transitions. [2019-10-07 15:27:17,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 5118 transitions. [2019-10-07 15:27:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 15:27:17,654 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:17,654 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:27:17,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 213050117, now seen corresponding path program 1 times [2019-10-07 15:27:17,655 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:17,655 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:17,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:17,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:27:17,722 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:17,723 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:17,723 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:17,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:17,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:17,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:17,728 INFO L87 Difference]: Start difference. First operand 3445 states and 5118 transitions. Second operand 3 states. [2019-10-07 15:27:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:17,999 INFO L93 Difference]: Finished difference Result 6870 states and 10212 transitions. [2019-10-07 15:27:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:18,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 15:27:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:18,017 INFO L225 Difference]: With dead ends: 6870 [2019-10-07 15:27:18,018 INFO L226 Difference]: Without dead ends: 3431 [2019-10-07 15:27:18,030 INFO L606 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 [2019-10-07 15:27:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-10-07 15:27:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2019-10-07 15:27:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2019-10-07 15:27:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5098 transitions. [2019-10-07 15:27:18,130 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5098 transitions. Word has length 18 [2019-10-07 15:27:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:18,130 INFO L462 AbstractCegarLoop]: Abstraction has 3431 states and 5098 transitions. [2019-10-07 15:27:18,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5098 transitions. [2019-10-07 15:27:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 15:27:18,142 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:18,142 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:27:18,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1483149835, now seen corresponding path program 1 times [2019-10-07 15:27:18,144 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:18,144 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:18,144 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:18,144 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:18,203 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:18,203 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:18,203 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:18,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:18,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:18,204 INFO L87 Difference]: Start difference. First operand 3431 states and 5098 transitions. Second operand 3 states. [2019-10-07 15:27:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:18,838 INFO L93 Difference]: Finished difference Result 10265 states and 15264 transitions. [2019-10-07 15:27:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 15:27:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:18,883 INFO L225 Difference]: With dead ends: 10265 [2019-10-07 15:27:18,883 INFO L226 Difference]: Without dead ends: 6835 [2019-10-07 15:27:18,895 INFO L606 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 [2019-10-07 15:27:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2019-10-07 15:27:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6791. [2019-10-07 15:27:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6791 states. [2019-10-07 15:27:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6791 states to 6791 states and 10106 transitions. [2019-10-07 15:27:19,064 INFO L78 Accepts]: Start accepts. Automaton has 6791 states and 10106 transitions. Word has length 21 [2019-10-07 15:27:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:19,065 INFO L462 AbstractCegarLoop]: Abstraction has 6791 states and 10106 transitions. [2019-10-07 15:27:19,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6791 states and 10106 transitions. [2019-10-07 15:27:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 15:27:19,071 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:19,071 INFO L385 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] [2019-10-07 15:27:19,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1694672428, now seen corresponding path program 1 times [2019-10-07 15:27:19,072 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:19,072 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:19,072 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:19,072 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:27:19,143 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:19,143 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:19,143 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:19,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:19,144 INFO L87 Difference]: Start difference. First operand 6791 states and 10106 transitions. Second operand 3 states. [2019-10-07 15:27:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:19,433 INFO L93 Difference]: Finished difference Result 13581 states and 20211 transitions. [2019-10-07 15:27:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:19,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-07 15:27:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:19,491 INFO L225 Difference]: With dead ends: 13581 [2019-10-07 15:27:19,491 INFO L226 Difference]: Without dead ends: 6801 [2019-10-07 15:27:19,514 INFO L606 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 [2019-10-07 15:27:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6801 states. [2019-10-07 15:27:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6801 to 6799. [2019-10-07 15:27:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6799 states. [2019-10-07 15:27:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10114 transitions. [2019-10-07 15:27:19,729 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10114 transitions. Word has length 24 [2019-10-07 15:27:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:19,729 INFO L462 AbstractCegarLoop]: Abstraction has 6799 states and 10114 transitions. [2019-10-07 15:27:19,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10114 transitions. [2019-10-07 15:27:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 15:27:19,731 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:19,732 INFO L385 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] [2019-10-07 15:27:19,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1363031116, now seen corresponding path program 1 times [2019-10-07 15:27:19,733 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:19,733 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:19,733 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:19,733 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:19,820 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:19,820 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:19,821 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:19,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:19,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:19,822 INFO L87 Difference]: Start difference. First operand 6799 states and 10114 transitions. Second operand 3 states. [2019-10-07 15:27:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:20,118 INFO L93 Difference]: Finished difference Result 13599 states and 20231 transitions. [2019-10-07 15:27:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:20,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-07 15:27:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:20,163 INFO L225 Difference]: With dead ends: 13599 [2019-10-07 15:27:20,164 INFO L226 Difference]: Without dead ends: 6811 [2019-10-07 15:27:20,183 INFO L606 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 [2019-10-07 15:27:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2019-10-07 15:27:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 6809. [2019-10-07 15:27:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2019-10-07 15:27:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 10124 transitions. [2019-10-07 15:27:20,409 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 10124 transitions. Word has length 32 [2019-10-07 15:27:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:20,410 INFO L462 AbstractCegarLoop]: Abstraction has 6809 states and 10124 transitions. [2019-10-07 15:27:20,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 10124 transitions. [2019-10-07 15:27:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-07 15:27:20,424 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:20,426 INFO L385 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] [2019-10-07 15:27:20,426 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1894507774, now seen corresponding path program 1 times [2019-10-07 15:27:20,432 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:20,432 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:20,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:20,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:20,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:20,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:20,852 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:20,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:20,858 INFO L87 Difference]: Start difference. First operand 6809 states and 10124 transitions. Second operand 3 states. [2019-10-07 15:27:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:21,199 INFO L93 Difference]: Finished difference Result 7382 states and 10969 transitions. [2019-10-07 15:27:21,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:21,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-07 15:27:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:21,231 INFO L225 Difference]: With dead ends: 7382 [2019-10-07 15:27:21,231 INFO L226 Difference]: Without dead ends: 7376 [2019-10-07 15:27:21,235 INFO L606 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 [2019-10-07 15:27:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-07 15:27:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7368. [2019-10-07 15:27:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7368 states. [2019-10-07 15:27:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7368 states to 7368 states and 10955 transitions. [2019-10-07 15:27:21,443 INFO L78 Accepts]: Start accepts. Automaton has 7368 states and 10955 transitions. Word has length 284 [2019-10-07 15:27:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 7368 states and 10955 transitions. [2019-10-07 15:27:21,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7368 states and 10955 transitions. [2019-10-07 15:27:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-07 15:27:21,453 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:21,454 INFO L385 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] [2019-10-07 15:27:21,454 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1410589622, now seen corresponding path program 1 times [2019-10-07 15:27:21,455 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:21,455 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:21,455 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:21,456 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:21,995 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:21,995 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:21,995 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:21,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:21,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:21,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:21,997 INFO L87 Difference]: Start difference. First operand 7368 states and 10955 transitions. Second operand 3 states. [2019-10-07 15:27:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:22,641 INFO L93 Difference]: Finished difference Result 20958 states and 31173 transitions. [2019-10-07 15:27:22,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:22,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-10-07 15:27:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:22,677 INFO L225 Difference]: With dead ends: 20958 [2019-10-07 15:27:22,677 INFO L226 Difference]: Without dead ends: 14160 [2019-10-07 15:27:22,695 INFO L606 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 [2019-10-07 15:27:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-10-07 15:27:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 14120. [2019-10-07 15:27:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14120 states. [2019-10-07 15:27:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14120 states to 14120 states and 21004 transitions. [2019-10-07 15:27:23,026 INFO L78 Accepts]: Start accepts. Automaton has 14120 states and 21004 transitions. Word has length 285 [2019-10-07 15:27:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:23,027 INFO L462 AbstractCegarLoop]: Abstraction has 14120 states and 21004 transitions. [2019-10-07 15:27:23,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 14120 states and 21004 transitions. [2019-10-07 15:27:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-07 15:27:23,033 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:23,034 INFO L385 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] [2019-10-07 15:27:23,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1377660482, now seen corresponding path program 1 times [2019-10-07 15:27:23,035 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:23,035 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:23,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:23,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:23,334 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:23,335 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:23,335 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:23,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:23,338 INFO L87 Difference]: Start difference. First operand 14120 states and 21004 transitions. Second operand 3 states. [2019-10-07 15:27:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:23,766 INFO L93 Difference]: Finished difference Result 27670 states and 41166 transitions. [2019-10-07 15:27:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:23,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-07 15:27:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:23,804 INFO L225 Difference]: With dead ends: 27670 [2019-10-07 15:27:23,804 INFO L226 Difference]: Without dead ends: 14120 [2019-10-07 15:27:23,831 INFO L606 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 [2019-10-07 15:27:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14120 states. [2019-10-07 15:27:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14120 to 14114. [2019-10-07 15:27:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14114 states. [2019-10-07 15:27:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14114 states to 14114 states and 20987 transitions. [2019-10-07 15:27:24,092 INFO L78 Accepts]: Start accepts. Automaton has 14114 states and 20987 transitions. Word has length 293 [2019-10-07 15:27:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:24,093 INFO L462 AbstractCegarLoop]: Abstraction has 14114 states and 20987 transitions. [2019-10-07 15:27:24,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14114 states and 20987 transitions. [2019-10-07 15:27:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-07 15:27:24,099 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:24,099 INFO L385 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] [2019-10-07 15:27:24,100 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash 225215221, now seen corresponding path program 1 times [2019-10-07 15:27:24,100 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:24,101 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:24,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:24,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:27:24,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:24,290 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:24,290 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:24,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:24,292 INFO L87 Difference]: Start difference. First operand 14114 states and 20987 transitions. Second operand 3 states. [2019-10-07 15:27:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:24,565 INFO L93 Difference]: Finished difference Result 22613 states and 33617 transitions. [2019-10-07 15:27:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:24,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-07 15:27:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:24,682 INFO L225 Difference]: With dead ends: 22613 [2019-10-07 15:27:24,683 INFO L226 Difference]: Without dead ends: 9069 [2019-10-07 15:27:24,707 INFO L606 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 [2019-10-07 15:27:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-10-07 15:27:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 9067. [2019-10-07 15:27:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9067 states. [2019-10-07 15:27:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9067 states to 9067 states and 13462 transitions. [2019-10-07 15:27:24,871 INFO L78 Accepts]: Start accepts. Automaton has 9067 states and 13462 transitions. Word has length 302 [2019-10-07 15:27:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:24,872 INFO L462 AbstractCegarLoop]: Abstraction has 9067 states and 13462 transitions. [2019-10-07 15:27:24,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 9067 states and 13462 transitions. [2019-10-07 15:27:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-07 15:27:24,880 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:24,880 INFO L385 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] [2019-10-07 15:27:24,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1514316248, now seen corresponding path program 1 times [2019-10-07 15:27:24,881 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:24,881 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:24,881 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:24,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:25,128 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:25,129 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:25,129 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:25,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:25,131 INFO L87 Difference]: Start difference. First operand 9067 states and 13462 transitions. Second operand 3 states. [2019-10-07 15:27:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:25,446 INFO L93 Difference]: Finished difference Result 15310 states and 22727 transitions. [2019-10-07 15:27:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:25,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-07 15:27:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:25,468 INFO L225 Difference]: With dead ends: 15310 [2019-10-07 15:27:25,468 INFO L226 Difference]: Without dead ends: 6813 [2019-10-07 15:27:25,486 INFO L606 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 [2019-10-07 15:27:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6813 states. [2019-10-07 15:27:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6813 to 6811. [2019-10-07 15:27:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6811 states. [2019-10-07 15:27:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10103 transitions. [2019-10-07 15:27:25,615 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 10103 transitions. Word has length 303 [2019-10-07 15:27:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:25,615 INFO L462 AbstractCegarLoop]: Abstraction has 6811 states and 10103 transitions. [2019-10-07 15:27:25,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 10103 transitions. [2019-10-07 15:27:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-07 15:27:25,624 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:25,625 INFO L385 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] [2019-10-07 15:27:25,625 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash 767389460, now seen corresponding path program 1 times [2019-10-07 15:27:25,626 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:25,626 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:25,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:25,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 15:27:27,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:27,617 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:27,617 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:27:27,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:27:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:27:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:27:27,618 INFO L87 Difference]: Start difference. First operand 6811 states and 10103 transitions. Second operand 4 states. [2019-10-07 15:27:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:28,096 INFO L93 Difference]: Finished difference Result 7955 states and 11793 transitions. [2019-10-07 15:27:28,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:27:28,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-10-07 15:27:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:28,115 INFO L225 Difference]: With dead ends: 7955 [2019-10-07 15:27:28,115 INFO L226 Difference]: Without dead ends: 7953 [2019-10-07 15:27:28,119 INFO L606 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 [2019-10-07 15:27:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2019-10-07 15:27:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7943. [2019-10-07 15:27:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2019-10-07 15:27:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 11782 transitions. [2019-10-07 15:27:28,245 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 11782 transitions. Word has length 303 [2019-10-07 15:27:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:28,246 INFO L462 AbstractCegarLoop]: Abstraction has 7943 states and 11782 transitions. [2019-10-07 15:27:28,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:27:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11782 transitions. [2019-10-07 15:27:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-07 15:27:28,252 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:28,253 INFO L385 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] [2019-10-07 15:27:28,253 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1141220564, now seen corresponding path program 1 times [2019-10-07 15:27:28,254 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:28,254 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:28,254 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:28,254 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:27:28,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:28,413 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:28,413 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:28,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:28,415 INFO L87 Difference]: Start difference. First operand 7943 states and 11782 transitions. Second operand 3 states. [2019-10-07 15:27:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:28,795 INFO L93 Difference]: Finished difference Result 13643 states and 20231 transitions. [2019-10-07 15:27:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:28,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-07 15:27:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:28,820 INFO L225 Difference]: With dead ends: 13643 [2019-10-07 15:27:28,821 INFO L226 Difference]: Without dead ends: 7975 [2019-10-07 15:27:28,830 INFO L606 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 [2019-10-07 15:27:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2019-10-07 15:27:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 7947. [2019-10-07 15:27:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7947 states. [2019-10-07 15:27:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7947 states to 7947 states and 11783 transitions. [2019-10-07 15:27:28,952 INFO L78 Accepts]: Start accepts. Automaton has 7947 states and 11783 transitions. Word has length 305 [2019-10-07 15:27:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:28,954 INFO L462 AbstractCegarLoop]: Abstraction has 7947 states and 11783 transitions. [2019-10-07 15:27:28,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11783 transitions. [2019-10-07 15:27:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-07 15:27:28,963 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:28,964 INFO L385 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] [2019-10-07 15:27:28,964 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash 339741106, now seen corresponding path program 1 times [2019-10-07 15:27:28,965 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:28,965 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:28,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:28,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:27:29,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:29,134 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:29,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:29,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:29,136 INFO L87 Difference]: Start difference. First operand 7947 states and 11783 transitions. Second operand 3 states. [2019-10-07 15:27:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:29,340 INFO L93 Difference]: Finished difference Result 11369 states and 16851 transitions. [2019-10-07 15:27:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:29,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-10-07 15:27:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:29,355 INFO L225 Difference]: With dead ends: 11369 [2019-10-07 15:27:29,356 INFO L226 Difference]: Without dead ends: 5701 [2019-10-07 15:27:29,364 INFO L606 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 [2019-10-07 15:27:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-10-07 15:27:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5699. [2019-10-07 15:27:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5699 states. [2019-10-07 15:27:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 8436 transitions. [2019-10-07 15:27:29,451 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 8436 transitions. Word has length 306 [2019-10-07 15:27:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:29,452 INFO L462 AbstractCegarLoop]: Abstraction has 5699 states and 8436 transitions. [2019-10-07 15:27:29,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 8436 transitions. [2019-10-07 15:27:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-07 15:27:29,459 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:29,460 INFO L385 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] [2019-10-07 15:27:29,460 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash -702866158, now seen corresponding path program 1 times [2019-10-07 15:27:29,461 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:29,461 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:29,461 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:29,461 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-07 15:27:29,686 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:29,687 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:29,687 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:29,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:29,688 INFO L87 Difference]: Start difference. First operand 5699 states and 8436 transitions. Second operand 3 states. [2019-10-07 15:27:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:29,876 INFO L93 Difference]: Finished difference Result 8553 states and 12660 transitions. [2019-10-07 15:27:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:29,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-10-07 15:27:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:29,889 INFO L225 Difference]: With dead ends: 8553 [2019-10-07 15:27:29,889 INFO L226 Difference]: Without dead ends: 5133 [2019-10-07 15:27:29,894 INFO L606 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 [2019-10-07 15:27:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-10-07 15:27:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5131. [2019-10-07 15:27:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5131 states. [2019-10-07 15:27:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5131 states to 5131 states and 7593 transitions. [2019-10-07 15:27:29,971 INFO L78 Accepts]: Start accepts. Automaton has 5131 states and 7593 transitions. Word has length 320 [2019-10-07 15:27:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:29,972 INFO L462 AbstractCegarLoop]: Abstraction has 5131 states and 7593 transitions. [2019-10-07 15:27:29,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5131 states and 7593 transitions. [2019-10-07 15:27:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-10-07 15:27:29,989 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:29,990 INFO L385 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] [2019-10-07 15:27:29,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash -647183724, now seen corresponding path program 1 times [2019-10-07 15:27:29,991 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:29,991 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:29,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:29,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:27:30,467 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:30,467 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:30,467 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:30,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:30,469 INFO L87 Difference]: Start difference. First operand 5131 states and 7593 transitions. Second operand 3 states. [2019-10-07 15:27:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:30,811 INFO L93 Difference]: Finished difference Result 10267 states and 15195 transitions. [2019-10-07 15:27:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:30,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 569 [2019-10-07 15:27:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:30,829 INFO L225 Difference]: With dead ends: 10267 [2019-10-07 15:27:30,829 INFO L226 Difference]: Without dead ends: 7407 [2019-10-07 15:27:30,835 INFO L606 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 [2019-10-07 15:27:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7407 states. [2019-10-07 15:27:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7407 to 7389. [2019-10-07 15:27:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7389 states. [2019-10-07 15:27:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 10941 transitions. [2019-10-07 15:27:30,961 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 10941 transitions. Word has length 569 [2019-10-07 15:27:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:30,963 INFO L462 AbstractCegarLoop]: Abstraction has 7389 states and 10941 transitions. [2019-10-07 15:27:30,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 10941 transitions. [2019-10-07 15:27:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2019-10-07 15:27:30,986 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:30,986 INFO L385 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] [2019-10-07 15:27:30,987 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:30,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1690487704, now seen corresponding path program 1 times [2019-10-07 15:27:30,987 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:30,988 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:30,988 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:30,988 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:27:31,695 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:31,695 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:31,696 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:31,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:31,698 INFO L87 Difference]: Start difference. First operand 7389 states and 10941 transitions. Second operand 3 states. [2019-10-07 15:27:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:32,134 INFO L93 Difference]: Finished difference Result 18745 states and 27761 transitions. [2019-10-07 15:27:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:32,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 575 [2019-10-07 15:27:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:32,157 INFO L225 Difference]: With dead ends: 18745 [2019-10-07 15:27:32,157 INFO L226 Difference]: Without dead ends: 13631 [2019-10-07 15:27:32,167 INFO L606 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 [2019-10-07 15:27:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13631 states. [2019-10-07 15:27:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13631 to 13545. [2019-10-07 15:27:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13545 states. [2019-10-07 15:27:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13545 states to 13545 states and 20097 transitions. [2019-10-07 15:27:32,395 INFO L78 Accepts]: Start accepts. Automaton has 13545 states and 20097 transitions. Word has length 575 [2019-10-07 15:27:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:32,396 INFO L462 AbstractCegarLoop]: Abstraction has 13545 states and 20097 transitions. [2019-10-07 15:27:32,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13545 states and 20097 transitions. [2019-10-07 15:27:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-10-07 15:27:32,415 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:32,416 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 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] [2019-10-07 15:27:32,416 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 246873862, now seen corresponding path program 1 times [2019-10-07 15:27:32,417 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:32,417 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:32,417 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:32,417 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:27:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-07 15:27:33,066 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:33,066 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:27:33,066 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:27:33,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:27:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:27:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:27:33,068 INFO L87 Difference]: Start difference. First operand 13545 states and 20097 transitions. Second operand 3 states. [2019-10-07 15:27:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:27:33,402 INFO L93 Difference]: Finished difference Result 20309 states and 30135 transitions. [2019-10-07 15:27:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:27:33,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 585 [2019-10-07 15:27:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:27:33,434 INFO L225 Difference]: With dead ends: 20309 [2019-10-07 15:27:33,434 INFO L226 Difference]: Without dead ends: 20301 [2019-10-07 15:27:33,442 INFO L606 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 [2019-10-07 15:27:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20301 states. [2019-10-07 15:27:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20301 to 20259. [2019-10-07 15:27:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20259 states. [2019-10-07 15:27:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20259 states to 20259 states and 30081 transitions. [2019-10-07 15:27:33,740 INFO L78 Accepts]: Start accepts. Automaton has 20259 states and 30081 transitions. Word has length 585 [2019-10-07 15:27:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:27:33,743 INFO L462 AbstractCegarLoop]: Abstraction has 20259 states and 30081 transitions. [2019-10-07 15:27:33,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:27:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20259 states and 30081 transitions. [2019-10-07 15:27:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-10-07 15:27:33,770 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:27:33,770 INFO L385 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] [2019-10-07 15:27:33,771 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:27:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:27:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1832363448, now seen corresponding path program 1 times [2019-10-07 15:27:33,771 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:27:33,772 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:27:33,772 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:33,772 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:27:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:27:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 15:27:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 15:27:34,393 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-07 15:27:34,393 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-07 15:27:34,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 03:27:34 BoogieIcfgContainer [2019-10-07 15:27:34,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 15:27:34,598 INFO L168 Benchmark]: Toolchain (without parser) took 249985.05 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 169.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-10-07 15:27:34,599 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 15:27:34,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174718.90 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 169.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. [2019-10-07 15:27:34,602 INFO L168 Benchmark]: Boogie Preprocessor took 30516.15 ms. Allocated memory was 5.8 GB in the beginning and 5.9 GB in the end (delta: 73.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -242.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-07 15:27:34,605 INFO L168 Benchmark]: RCFGBuilder took 26128.82 ms. Allocated memory was 5.9 GB in the beginning and 6.1 GB in the end (delta: 169.3 MB). Free memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: -429.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-07 15:27:34,606 INFO L168 Benchmark]: TraceAbstraction took 18614.52 ms. Allocated memory was 6.1 GB in the beginning and 5.9 GB in the end (delta: -161.0 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -8.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 15:27:34,616 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 174718.90 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 169.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30516.15 ms. Allocated memory was 5.8 GB in the beginning and 5.9 GB in the end (delta: 73.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -242.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * RCFGBuilder took 26128.82 ms. Allocated memory was 5.9 GB in the beginning and 6.1 GB in the end (delta: 169.3 MB). Free memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: -429.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * TraceAbstraction took 18614.52 ms. Allocated memory was 6.1 GB in the beginning and 5.9 GB in the end (delta: -161.0 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -8.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26700]: 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; [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=0, 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=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=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=0, 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] [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=0, 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] [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=0, 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] [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=0, 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=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=0, 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] [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=0, 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] [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=0, 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] [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=0, 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] [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=0, 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] [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=0, 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] [L26700] __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=0, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 5011 locations, 1 error locations. Result: UNSAFE, OverallTime: 18.5s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 96810 SDtfs, 43630 SDslu, 71170 SDs, 0 SdLazy, 2173 SolverSat, 852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20259occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 5139 NumberOfCodeBlocks, 5139 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4532 ConstructedInterpolants, 0 QuantifiedInterpolants, 7176182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 211/211 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...