java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:48:41,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:48:41,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:48:41,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:48:41,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:48:41,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:48:41,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:48:41,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:48:41,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:48:41,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:48:41,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:48:41,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:48:41,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:48:41,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:48:41,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:48:41,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:48:41,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:48:41,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:48:41,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:48:41,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:48:41,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:48:41,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:48:41,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:48:41,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:48:41,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:48:41,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:48:41,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:48:41,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:48:41,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:48:41,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:48:41,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:48:41,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:48:41,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:48:41,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:48:41,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:48:41,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:48:41,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:48:41,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:48:41,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:48:41,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:48:41,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:48:41,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:48:41,803 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:48:41,803 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:48:41,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:48:41,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:48:41,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:48:41,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:48:41,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:48:41,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:48:41,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:48:41,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:48:41,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:48:41,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:48:41,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:48:41,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:48:41,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:48:41,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:48:41,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:48:41,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:48:41,806 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:48:41,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:48:41,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:48:41,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:48:41,807 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:48:41,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:48:41,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:48:41,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:48:41,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:48:41,902 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:48:41,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-11-06 19:48:41,972 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d600624/15f27a618c5c43809276b6dce6ed16ff/FLAGe2f2cb928 [2018-11-06 19:48:42,552 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:48:42,555 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08_true-unreach-call_false-termination.c [2018-11-06 19:48:42,571 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d600624/15f27a618c5c43809276b6dce6ed16ff/FLAGe2f2cb928 [2018-11-06 19:48:42,586 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d600624/15f27a618c5c43809276b6dce6ed16ff [2018-11-06 19:48:42,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:48:42,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:48:42,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:48:42,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:48:42,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:48:42,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:48:42" (1/1) ... [2018-11-06 19:48:42,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42844b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:42, skipping insertion in model container [2018-11-06 19:48:42,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:48:42" (1/1) ... [2018-11-06 19:48:42,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:48:42,691 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:48:43,217 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:48:43,229 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:48:43,358 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:48:43,377 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:48:43,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43 WrapperNode [2018-11-06 19:48:43,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:48:43,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:48:43,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:48:43,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:48:43,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:48:43,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:48:43,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:48:43,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:48:43,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (1/1) ... [2018-11-06 19:48:43,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:48:43,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:48:43,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:48:43,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:48:43,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (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 [2018-11-06 19:48:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:48:43,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:48:43,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:48:47,091 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:48:47,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:47 BoogieIcfgContainer [2018-11-06 19:48:47,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:48:47,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:48:47,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:48:47,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:48:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:48:42" (1/3) ... [2018-11-06 19:48:47,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cb07af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:47, skipping insertion in model container [2018-11-06 19:48:47,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:43" (2/3) ... [2018-11-06 19:48:47,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cb07af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:47, skipping insertion in model container [2018-11-06 19:48:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:47" (3/3) ... [2018-11-06 19:48:47,101 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label08_true-unreach-call_false-termination.c [2018-11-06 19:48:47,110 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:48:47,120 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:48:47,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:48:47,175 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:48:47,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:48:47,177 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:48:47,177 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:48:47,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:48:47,177 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:48:47,178 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:48:47,178 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:48:47,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:48:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:48:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-06 19:48:47,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:47,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:47,220 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:47,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:47,226 INFO L82 PathProgramCache]: Analyzing trace with hash -518577065, now seen corresponding path program 1 times [2018-11-06 19:48:47,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:48:47,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:47,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:47,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:47,770 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-11-06 19:48:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:49,311 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-11-06 19:48:49,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:49,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-06 19:48:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:49,334 INFO L225 Difference]: With dead ends: 531 [2018-11-06 19:48:49,334 INFO L226 Difference]: Without dead ends: 328 [2018-11-06 19:48:49,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-06 19:48:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-06 19:48:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-06 19:48:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-11-06 19:48:49,406 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 114 [2018-11-06 19:48:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:49,408 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-11-06 19:48:49,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-11-06 19:48:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-06 19:48:49,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:49,414 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:48:49,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:49,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 866940335, now seen corresponding path program 1 times [2018-11-06 19:48:49,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:48:49,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:49,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:49,703 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-11-06 19:48:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:51,565 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-11-06 19:48:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-11-06 19:48:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:51,583 INFO L225 Difference]: With dead ends: 1182 [2018-11-06 19:48:51,583 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:48:51,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:48:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:48:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:48:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1275 transitions. [2018-11-06 19:48:51,653 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1275 transitions. Word has length 119 [2018-11-06 19:48:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:51,654 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1275 transitions. [2018-11-06 19:48:51,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1275 transitions. [2018-11-06 19:48:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-06 19:48:51,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:51,662 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:51,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:51,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:51,663 INFO L82 PathProgramCache]: Analyzing trace with hash 587522573, now seen corresponding path program 1 times [2018-11-06 19:48:51,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:51,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:48:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:51,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:51,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:51,803 INFO L87 Difference]: Start difference. First operand 856 states and 1275 transitions. Second operand 3 states. [2018-11-06 19:48:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:53,830 INFO L93 Difference]: Finished difference Result 1974 states and 3012 transitions. [2018-11-06 19:48:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2018-11-06 19:48:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:53,842 INFO L225 Difference]: With dead ends: 1974 [2018-11-06 19:48:53,842 INFO L226 Difference]: Without dead ends: 1120 [2018-11-06 19:48:53,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-11-06 19:48:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2018-11-06 19:48:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-11-06 19:48:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1703 transitions. [2018-11-06 19:48:53,883 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1703 transitions. Word has length 150 [2018-11-06 19:48:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1703 transitions. [2018-11-06 19:48:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1703 transitions. [2018-11-06 19:48:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 19:48:53,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:53,935 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:53,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:53,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 250825923, now seen corresponding path program 1 times [2018-11-06 19:48:53,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:53,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:53,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:54,229 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 19:48:54,773 WARN L179 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-06 19:48:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-06 19:48:54,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:54,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:54,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:54,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:54,804 INFO L87 Difference]: Start difference. First operand 1120 states and 1703 transitions. Second operand 4 states. [2018-11-06 19:48:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:56,429 INFO L93 Difference]: Finished difference Result 2373 states and 3570 transitions. [2018-11-06 19:48:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:56,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-06 19:48:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:56,436 INFO L225 Difference]: With dead ends: 2373 [2018-11-06 19:48:56,437 INFO L226 Difference]: Without dead ends: 1255 [2018-11-06 19:48:56,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:48:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2018-11-06 19:48:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1252. [2018-11-06 19:48:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:48:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1841 transitions. [2018-11-06 19:48:56,466 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1841 transitions. Word has length 154 [2018-11-06 19:48:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1841 transitions. [2018-11-06 19:48:56,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1841 transitions. [2018-11-06 19:48:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-06 19:48:56,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:56,470 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:56,470 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:56,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1832019483, now seen corresponding path program 1 times [2018-11-06 19:48:56,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 19:48:56,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:56,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:56,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:56,599 INFO L87 Difference]: Start difference. First operand 1252 states and 1841 transitions. Second operand 3 states. [2018-11-06 19:48:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:57,226 INFO L93 Difference]: Finished difference Result 3162 states and 4718 transitions. [2018-11-06 19:48:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:57,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-11-06 19:48:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:57,238 INFO L225 Difference]: With dead ends: 3162 [2018-11-06 19:48:57,238 INFO L226 Difference]: Without dead ends: 2044 [2018-11-06 19:48:57,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-11-06 19:48:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-11-06 19:48:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-11-06 19:48:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2828 transitions. [2018-11-06 19:48:57,280 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2828 transitions. Word has length 159 [2018-11-06 19:48:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:57,280 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 2828 transitions. [2018-11-06 19:48:57,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2828 transitions. [2018-11-06 19:48:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-06 19:48:57,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:57,286 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:57,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:57,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash -525557366, now seen corresponding path program 1 times [2018-11-06 19:48:57,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:57,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-06 19:48:57,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:57,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:48:57,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:57,384 INFO L87 Difference]: Start difference. First operand 2044 states and 2828 transitions. Second operand 4 states. [2018-11-06 19:48:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:58,602 INFO L93 Difference]: Finished difference Result 6850 states and 9424 transitions. [2018-11-06 19:48:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:58,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-11-06 19:48:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:58,631 INFO L225 Difference]: With dead ends: 6850 [2018-11-06 19:48:58,632 INFO L226 Difference]: Without dead ends: 4940 [2018-11-06 19:48:58,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-11-06 19:48:58,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-11-06 19:48:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-11-06 19:48:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6244 transitions. [2018-11-06 19:48:58,725 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6244 transitions. Word has length 169 [2018-11-06 19:48:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:58,726 INFO L480 AbstractCegarLoop]: Abstraction has 4940 states and 6244 transitions. [2018-11-06 19:48:58,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6244 transitions. [2018-11-06 19:48:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 19:48:58,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:58,735 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:58,735 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:58,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -663352242, now seen corresponding path program 1 times [2018-11-06 19:48:58,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 19:48:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:59,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:59,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:59,019 INFO L87 Difference]: Start difference. First operand 4940 states and 6244 transitions. Second operand 4 states. [2018-11-06 19:49:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:00,331 INFO L93 Difference]: Finished difference Result 9878 states and 12543 transitions. [2018-11-06 19:49:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:00,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-11-06 19:49:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:00,354 INFO L225 Difference]: With dead ends: 9878 [2018-11-06 19:49:00,355 INFO L226 Difference]: Without dead ends: 5072 [2018-11-06 19:49:00,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2018-11-06 19:49:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2018-11-06 19:49:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2018-11-06 19:49:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 6332 transitions. [2018-11-06 19:49:00,528 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 6332 transitions. Word has length 193 [2018-11-06 19:49:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:00,528 INFO L480 AbstractCegarLoop]: Abstraction has 5072 states and 6332 transitions. [2018-11-06 19:49:00,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 6332 transitions. [2018-11-06 19:49:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-06 19:49:00,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:00,539 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:49:00,539 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:00,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash -163742655, now seen corresponding path program 1 times [2018-11-06 19:49:00,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:00,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:00,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:49:00,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:00,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:00,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:00,888 INFO L87 Difference]: Start difference. First operand 5072 states and 6332 transitions. Second operand 4 states. [2018-11-06 19:49:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:03,994 INFO L93 Difference]: Finished difference Result 9742 states and 12191 transitions. [2018-11-06 19:49:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:03,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-11-06 19:49:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:04,008 INFO L225 Difference]: With dead ends: 9742 [2018-11-06 19:49:04,008 INFO L226 Difference]: Without dead ends: 3062 [2018-11-06 19:49:04,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2018-11-06 19:49:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2930. [2018-11-06 19:49:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2018-11-06 19:49:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 3230 transitions. [2018-11-06 19:49:04,069 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 3230 transitions. Word has length 207 [2018-11-06 19:49:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:04,069 INFO L480 AbstractCegarLoop]: Abstraction has 2930 states and 3230 transitions. [2018-11-06 19:49:04,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 3230 transitions. [2018-11-06 19:49:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-06 19:49:04,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:04,079 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:49:04,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:04,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1770533445, now seen corresponding path program 1 times [2018-11-06 19:49:04,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:04,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-06 19:49:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:04,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:04,349 INFO L87 Difference]: Start difference. First operand 2930 states and 3230 transitions. Second operand 3 states. [2018-11-06 19:49:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:05,100 INFO L93 Difference]: Finished difference Result 7040 states and 7764 transitions. [2018-11-06 19:49:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:05,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-06 19:49:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:05,101 INFO L225 Difference]: With dead ends: 7040 [2018-11-06 19:49:05,101 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:05,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:05,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 221 [2018-11-06 19:49:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:05,109 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:05,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:05,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:05,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:05,382 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-06 19:49:05,530 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,533 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:05,534 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:05,535 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:05,536 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,537 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:05,538 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:05,539 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:05,539 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:05,539 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:05,539 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:05,539 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= 6 ~a16~0))) (.cse0 (= ~a8~0 13)) (.cse3 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1))) (or (and .cse0 (= ~a20~0 1)) (and .cse1 .cse0 (= ~a17~0 1)) (and .cse2 (= ~a16~0 5)) (and .cse3 .cse1 .cse2) (and .cse1 .cse2 (not .cse0)) (and .cse3 (= ~a8~0 15) .cse2))) [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,540 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:05,541 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,542 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:05,543 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:05,544 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:05,545 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= 6 ~a16~0))) (.cse0 (= ~a8~0 13)) (.cse3 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1))) (or (and .cse0 (= ~a20~0 1)) (and .cse1 .cse0 (= ~a17~0 1)) (and .cse2 (= ~a16~0 5)) (and .cse3 .cse1 .cse2) (and .cse1 .cse2 (not .cse0)) (and .cse3 (= ~a8~0 15) .cse2))) [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:05,546 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:05,547 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,548 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:05,549 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:05,550 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:05,551 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:05,552 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:05,553 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:05,553 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:05,553 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:05,553 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:05,553 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:05 BoogieIcfgContainer [2018-11-06 19:49:05,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:05,579 INFO L168 Benchmark]: Toolchain (without parser) took 22982.77 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -664.1 MB). Peak memory consumption was 437.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,581 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:05,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,584 INFO L168 Benchmark]: Boogie Preprocessor took 110.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,585 INFO L168 Benchmark]: RCFGBuilder took 3405.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,586 INFO L168 Benchmark]: TraceAbstraction took 18485.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 367.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:05,592 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 197.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3405.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18485.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 367.0 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((a8 == 13 && a20 == 1) || ((!(6 == a16) && a8 == 13) && a17 == 1)) || (a21 == 1 && a16 == 5)) || ((!(a7 == 1) && !(6 == a16)) && a21 == 1)) || ((!(6 == a16) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a8 == 15) && a21 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((a8 == 13 && a20 == 1) || ((!(6 == a16) && a8 == 13) && a17 == 1)) || (a21 == 1 && a16 == 5)) || ((!(a7 == 1) && !(6 == a16)) && a21 == 1)) || ((!(6 == a16) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a8 == 15) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1249 SDtfs, 2160 SDslu, 481 SDs, 0 SdLazy, 4741 SolverSat, 1157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5072occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 135 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 95 NumberOfFragments, 123 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1313 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1486 NumberOfCodeBlocks, 1486 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1477 ConstructedInterpolants, 0 QuantifiedInterpolants, 569467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 685/685 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...