java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label27_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:50:51,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:50:51,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:50:51,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:50:51,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:50:51,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:50:51,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:50:51,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:50:51,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:50:51,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:50:51,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:50:51,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:50:51,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:50:51,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:50:51,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:50:51,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:50:51,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:50:51,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:50:51,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:50:51,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:50:51,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:50:51,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:50:51,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:50:51,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:50:51,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:50:51,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:50:51,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:50:51,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:50:51,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:50:51,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:50:51,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:50:51,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:50:51,967 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:50:51,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:50:51,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:50:51,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:50:51,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:50:51,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:50:51,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:50:52,000 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:50:52,000 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:50:52,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:50:52,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:50:52,002 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:50:52,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:50:52,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:50:52,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:50:52,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:50:52,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:50:52,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:50:52,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:50:52,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:50:52,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:50:52,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:50:52,005 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:50:52,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:50:52,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:50:52,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:50:52,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:50:52,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:50:52,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:50:52,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:50:52,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:50:52,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:50:52,008 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:50:52,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:50:52,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:50:52,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:50:52,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:50:52,111 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:50:52,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-24 14:50:52,182 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6d8ac1111/affefe47c9414cc887b38eba27e6e641/FLAGc80077aa2 [2018-10-24 14:50:52,740 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:50:52,744 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-24 14:50:52,762 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6d8ac1111/affefe47c9414cc887b38eba27e6e641/FLAGc80077aa2 [2018-10-24 14:50:52,777 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6d8ac1111/affefe47c9414cc887b38eba27e6e641 [2018-10-24 14:50:52,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:50:52,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:50:52,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:52,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:50:52,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:50:52,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:52" (1/1) ... [2018-10-24 14:50:52,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:52, skipping insertion in model container [2018-10-24 14:50:52,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:50:52" (1/1) ... [2018-10-24 14:50:52,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:50:52,866 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:50:53,315 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:53,325 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:50:53,472 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:50:53,496 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:50:53,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53 WrapperNode [2018-10-24 14:50:53,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:50:53,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:53,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:50:53,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:50:53,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:50:53,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:50:53,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:50:53,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:50:53,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... [2018-10-24 14:50:53,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:50:53,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:50:53,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:50:53,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:50:53,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:50:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:50:53,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:50:53,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:50:56,814 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:50:56,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:56 BoogieIcfgContainer [2018-10-24 14:50:56,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:50:56,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:50:56,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:50:56,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:50:56,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:50:52" (1/3) ... [2018-10-24 14:50:56,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c642213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:56, skipping insertion in model container [2018-10-24 14:50:56,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:50:53" (2/3) ... [2018-10-24 14:50:56,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c642213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:50:56, skipping insertion in model container [2018-10-24 14:50:56,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:50:56" (3/3) ... [2018-10-24 14:50:56,829 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27_true-unreach-call_false-termination.c [2018-10-24 14:50:56,839 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:50:56,854 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:50:56,871 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:50:56,906 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:50:56,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:50:56,907 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:50:56,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:50:56,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:50:56,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:50:56,908 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:50:56,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:50:56,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:50:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:50:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-24 14:50:56,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:56,945 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] [2018-10-24 14:50:56,948 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:56,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash 648417167, now seen corresponding path program 1 times [2018-10-24 14:50:56,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:57,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:50:57,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:50:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:50:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:50:57,433 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-10-24 14:50:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:50:59,148 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-10-24 14:50:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:50:59,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-10-24 14:50:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:50:59,171 INFO L225 Difference]: With dead ends: 531 [2018-10-24 14:50:59,171 INFO L226 Difference]: Without dead ends: 328 [2018-10-24 14:50:59,178 INFO L605 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-10-24 14:50:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-24 14:50:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-24 14:50:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-24 14:50:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 533 transitions. [2018-10-24 14:50:59,292 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 533 transitions. Word has length 89 [2018-10-24 14:50:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:50:59,293 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 533 transitions. [2018-10-24 14:50:59,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:50:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 533 transitions. [2018-10-24 14:50:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-24 14:50:59,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:50:59,304 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:50:59,305 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:50:59,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:50:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 329528502, now seen corresponding path program 1 times [2018-10-24 14:50:59,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:50:59,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:50:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:59,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:50:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:50:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:50:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:50:59,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:50:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:50:59,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:50:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:50:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:50:59,461 INFO L87 Difference]: Start difference. First operand 328 states and 533 transitions. Second operand 4 states. [2018-10-24 14:51:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:00,849 INFO L93 Difference]: Finished difference Result 918 states and 1534 transitions. [2018-10-24 14:51:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:00,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-24 14:51:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:00,856 INFO L225 Difference]: With dead ends: 918 [2018-10-24 14:51:00,856 INFO L226 Difference]: Without dead ends: 592 [2018-10-24 14:51:00,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-24 14:51:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-10-24 14:51:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-24 14:51:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 895 transitions. [2018-10-24 14:51:00,892 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 895 transitions. Word has length 95 [2018-10-24 14:51:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:00,892 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 895 transitions. [2018-10-24 14:51:00,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 895 transitions. [2018-10-24 14:51:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 14:51:00,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:00,897 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:51:00,897 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:00,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash -621960128, now seen corresponding path program 1 times [2018-10-24 14:51:00,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:00,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:00,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:00,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:00,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:00,994 INFO L87 Difference]: Start difference. First operand 592 states and 895 transitions. Second operand 4 states. [2018-10-24 14:51:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:04,058 INFO L93 Difference]: Finished difference Result 2238 states and 3452 transitions. [2018-10-24 14:51:04,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:04,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-24 14:51:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:04,069 INFO L225 Difference]: With dead ends: 2238 [2018-10-24 14:51:04,069 INFO L226 Difference]: Without dead ends: 1648 [2018-10-24 14:51:04,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-24 14:51:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2018-10-24 14:51:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-10-24 14:51:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2339 transitions. [2018-10-24 14:51:04,122 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2339 transitions. Word has length 99 [2018-10-24 14:51:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:04,123 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 2339 transitions. [2018-10-24 14:51:04,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2339 transitions. [2018-10-24 14:51:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 14:51:04,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:04,131 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-24 14:51:04,131 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:04,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1407172958, now seen corresponding path program 1 times [2018-10-24 14:51:04,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:04,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:04,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:04,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 14:51:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:04,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:04,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:04,244 INFO L87 Difference]: Start difference. First operand 1648 states and 2339 transitions. Second operand 3 states. [2018-10-24 14:51:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:05,669 INFO L93 Difference]: Finished difference Result 3822 states and 5535 transitions. [2018-10-24 14:51:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:05,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-24 14:51:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:05,683 INFO L225 Difference]: With dead ends: 3822 [2018-10-24 14:51:05,683 INFO L226 Difference]: Without dead ends: 2176 [2018-10-24 14:51:05,686 INFO L605 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-10-24 14:51:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-10-24 14:51:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2018-10-24 14:51:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2018-10-24 14:51:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3102 transitions. [2018-10-24 14:51:05,740 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3102 transitions. Word has length 103 [2018-10-24 14:51:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:05,741 INFO L481 AbstractCegarLoop]: Abstraction has 2176 states and 3102 transitions. [2018-10-24 14:51:05,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3102 transitions. [2018-10-24 14:51:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-24 14:51:05,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:05,747 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:51:05,747 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:05,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1146288527, now seen corresponding path program 1 times [2018-10-24 14:51:05,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:05,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:05,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:06,035 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 14:51:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:06,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:06,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:06,139 INFO L87 Difference]: Start difference. First operand 2176 states and 3102 transitions. Second operand 4 states. [2018-10-24 14:51:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:07,284 INFO L93 Difference]: Finished difference Result 4669 states and 6590 transitions. [2018-10-24 14:51:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:51:07,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-10-24 14:51:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:07,299 INFO L225 Difference]: With dead ends: 4669 [2018-10-24 14:51:07,299 INFO L226 Difference]: Without dead ends: 2495 [2018-10-24 14:51:07,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:51:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-10-24 14:51:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2435. [2018-10-24 14:51:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:51:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3389 transitions. [2018-10-24 14:51:07,357 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3389 transitions. Word has length 105 [2018-10-24 14:51:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:07,357 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3389 transitions. [2018-10-24 14:51:07,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3389 transitions. [2018-10-24 14:51:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 14:51:07,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:07,363 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-24 14:51:07,363 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:07,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash -214678217, now seen corresponding path program 1 times [2018-10-24 14:51:07,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:07,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:07,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:07,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:07,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:07,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:07,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:07,608 INFO L87 Difference]: Start difference. First operand 2435 states and 3389 transitions. Second operand 4 states. [2018-10-24 14:51:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:09,202 INFO L93 Difference]: Finished difference Result 4868 states and 6776 transitions. [2018-10-24 14:51:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:09,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-24 14:51:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:09,218 INFO L225 Difference]: With dead ends: 4868 [2018-10-24 14:51:09,218 INFO L226 Difference]: Without dead ends: 2435 [2018-10-24 14:51:09,222 INFO L605 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-10-24 14:51:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-24 14:51:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-24 14:51:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:51:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3365 transitions. [2018-10-24 14:51:09,266 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3365 transitions. Word has length 110 [2018-10-24 14:51:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:09,267 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3365 transitions. [2018-10-24 14:51:09,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3365 transitions. [2018-10-24 14:51:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-24 14:51:09,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:09,270 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:09,271 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:09,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1790706102, now seen corresponding path program 1 times [2018-10-24 14:51:09,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:51:09,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:09,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:09,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:09,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:09,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:09,426 INFO L87 Difference]: Start difference. First operand 2435 states and 3365 transitions. Second operand 3 states. [2018-10-24 14:51:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:10,062 INFO L93 Difference]: Finished difference Result 4868 states and 6728 transitions. [2018-10-24 14:51:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:10,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-10-24 14:51:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:10,075 INFO L225 Difference]: With dead ends: 4868 [2018-10-24 14:51:10,076 INFO L226 Difference]: Without dead ends: 2435 [2018-10-24 14:51:10,080 INFO L605 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-10-24 14:51:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-10-24 14:51:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2018-10-24 14:51:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-24 14:51:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3341 transitions. [2018-10-24 14:51:10,122 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3341 transitions. Word has length 111 [2018-10-24 14:51:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:10,122 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 3341 transitions. [2018-10-24 14:51:10,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3341 transitions. [2018-10-24 14:51:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 14:51:10,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:10,126 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:10,126 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:10,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1091793797, now seen corresponding path program 1 times [2018-10-24 14:51:10,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:10,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:10,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:10,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:10,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:10,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:10,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:10,206 INFO L87 Difference]: Start difference. First operand 2435 states and 3341 transitions. Second operand 3 states. [2018-10-24 14:51:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:11,256 INFO L93 Difference]: Finished difference Result 6439 states and 8708 transitions. [2018-10-24 14:51:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:11,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-10-24 14:51:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:11,266 INFO L225 Difference]: With dead ends: 6439 [2018-10-24 14:51:11,267 INFO L226 Difference]: Without dead ends: 2946 [2018-10-24 14:51:11,271 INFO L605 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-10-24 14:51:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-10-24 14:51:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2018-10-24 14:51:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-24 14:51:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3387 transitions. [2018-10-24 14:51:11,327 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3387 transitions. Word has length 113 [2018-10-24 14:51:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:11,327 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3387 transitions. [2018-10-24 14:51:11,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3387 transitions. [2018-10-24 14:51:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 14:51:11,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:11,332 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:51:11,332 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:11,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:11,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1668509958, now seen corresponding path program 1 times [2018-10-24 14:51:11,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:11,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:11,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:11,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:11,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:11,651 INFO L87 Difference]: Start difference. First operand 2946 states and 3387 transitions. Second operand 4 states. [2018-10-24 14:51:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:15,247 INFO L93 Difference]: Finished difference Result 5758 states and 6637 transitions. [2018-10-24 14:51:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:15,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-10-24 14:51:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:15,258 INFO L225 Difference]: With dead ends: 5758 [2018-10-24 14:51:15,259 INFO L226 Difference]: Without dead ends: 2946 [2018-10-24 14:51:15,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-24 14:51:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-10-24 14:51:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2018-10-24 14:51:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-24 14:51:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3244 transitions. [2018-10-24 14:51:15,306 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3244 transitions. Word has length 127 [2018-10-24 14:51:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:15,306 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3244 transitions. [2018-10-24 14:51:15,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3244 transitions. [2018-10-24 14:51:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-24 14:51:15,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:15,312 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:51:15,312 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:15,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1006345560, now seen corresponding path program 1 times [2018-10-24 14:51:15,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:15,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:16,176 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-10-24 14:51:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:16,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-24 14:51:16,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 14:51:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 14:51:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-10-24 14:51:16,385 INFO L87 Difference]: Start difference. First operand 2946 states and 3244 transitions. Second operand 13 states. [2018-10-24 14:51:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:18,763 INFO L93 Difference]: Finished difference Result 6288 states and 6956 transitions. [2018-10-24 14:51:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 14:51:18,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2018-10-24 14:51:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:18,774 INFO L225 Difference]: With dead ends: 6288 [2018-10-24 14:51:18,774 INFO L226 Difference]: Without dead ends: 3476 [2018-10-24 14:51:18,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2018-10-24 14:51:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2018-10-24 14:51:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3275. [2018-10-24 14:51:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3275 states. [2018-10-24 14:51:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3591 transitions. [2018-10-24 14:51:18,823 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3591 transitions. Word has length 141 [2018-10-24 14:51:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:18,824 INFO L481 AbstractCegarLoop]: Abstraction has 3275 states and 3591 transitions. [2018-10-24 14:51:18,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 14:51:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3591 transitions. [2018-10-24 14:51:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 14:51:18,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:18,830 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 14:51:18,830 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:18,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2066764165, now seen corresponding path program 1 times [2018-10-24 14:51:18,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:19,333 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 14:51:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 14:51:19,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:19,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:19,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:19,361 INFO L87 Difference]: Start difference. First operand 3275 states and 3591 transitions. Second operand 4 states. [2018-10-24 14:51:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:20,573 INFO L93 Difference]: Finished difference Result 6686 states and 7357 transitions. [2018-10-24 14:51:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:20,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-24 14:51:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:20,582 INFO L225 Difference]: With dead ends: 6686 [2018-10-24 14:51:20,582 INFO L226 Difference]: Without dead ends: 3005 [2018-10-24 14:51:20,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-24 14:51:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2018-10-24 14:51:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2018-10-24 14:51:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3214 transitions. [2018-10-24 14:51:20,623 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3214 transitions. Word has length 186 [2018-10-24 14:51:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:20,623 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3214 transitions. [2018-10-24 14:51:20,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3214 transitions. [2018-10-24 14:51:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 14:51:20,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:20,630 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:51:20,630 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:20,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1694644432, now seen corresponding path program 1 times [2018-10-24 14:51:20,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:20,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:20,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-24 14:51:20,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:20,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:20,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:20,944 INFO L87 Difference]: Start difference. First operand 3005 states and 3214 transitions. Second operand 4 states. [2018-10-24 14:51:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:21,861 INFO L93 Difference]: Finished difference Result 8057 states and 8628 transitions. [2018-10-24 14:51:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:21,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-10-24 14:51:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:21,879 INFO L225 Difference]: With dead ends: 8057 [2018-10-24 14:51:21,879 INFO L226 Difference]: Without dead ends: 4652 [2018-10-24 14:51:21,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-24 14:51:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2018-10-24 14:51:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 3790. [2018-10-24 14:51:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2018-10-24 14:51:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4013 transitions. [2018-10-24 14:51:21,936 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4013 transitions. Word has length 236 [2018-10-24 14:51:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:21,937 INFO L481 AbstractCegarLoop]: Abstraction has 3790 states and 4013 transitions. [2018-10-24 14:51:21,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4013 transitions. [2018-10-24 14:51:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-24 14:51:21,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:21,944 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:21,944 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:21,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 317934217, now seen corresponding path program 1 times [2018-10-24 14:51:21,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-24 14:51:22,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:22,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:22,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:22,400 INFO L87 Difference]: Start difference. First operand 3790 states and 4013 transitions. Second operand 4 states. [2018-10-24 14:51:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:23,502 INFO L93 Difference]: Finished difference Result 8364 states and 8874 transitions. [2018-10-24 14:51:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:23,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-10-24 14:51:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:23,504 INFO L225 Difference]: With dead ends: 8364 [2018-10-24 14:51:23,504 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:23,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:23,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2018-10-24 14:51:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:23,511 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:23,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:23,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:23,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:25,023 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2018-10-24 14:51:25,796 WARN L179 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2018-10-24 14:51:25,799 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:25,799 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:25,800 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:25,801 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:25,802 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:25,803 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,804 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:25,805 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:25,806 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse13 (= ~a8~0 15)) (.cse10 (= ~a20~0 1)) (.cse16 (= ~a16~0 6))) (let ((.cse1 (not .cse16)) (.cse3 (not (= 5 ~a16~0))) (.cse6 (= ~a16~0 4)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a8~0 14)) (.cse12 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse4 (not .cse13)) (.cse15 (not .cse9)) (.cse14 (= ~a16~0 5)) (.cse17 (not .cse5)) (.cse11 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse8 .cse2) (and .cse4 .cse9 .cse2 .cse3) (and .cse10 .cse6 .cse11 .cse7 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3) (and .cse6 .cse11 .cse7 .cse2 .cse12) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse13 .cse9 .cse11 .cse2 .cse14) (and .cse6 .cse4 .cse7 .cse2) (and .cse8 .cse2 .cse15 .cse12 .cse14) (and .cse0 .cse13 .cse11 .cse2 .cse14) (and .cse5 .cse4 .cse16) (and .cse5 .cse9 .cse2) (and .cse0 .cse13 .cse11 .cse2 .cse16) (and .cse5 .cse0 .cse2 .cse14) (and .cse5 .cse9 .cse4) (and .cse17 .cse13 .cse11 .cse2 .cse15 .cse14) (and .cse17 .cse13 .cse11 .cse2 .cse16)))) [2018-10-24 14:51:25,806 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,806 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,806 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:25,807 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:25,808 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,809 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:25,810 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:25,811 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:25,812 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,813 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse13 (= ~a8~0 15)) (.cse10 (= ~a20~0 1)) (.cse16 (= ~a16~0 6))) (let ((.cse1 (not .cse16)) (.cse3 (not (= 5 ~a16~0))) (.cse6 (= ~a16~0 4)) (.cse7 (<= ~a17~0 0)) (.cse8 (= ~a8~0 14)) (.cse15 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse14 (= ~a16~0 5)) (.cse9 (= ~a17~0 1)) (.cse4 (not .cse13)) (.cse12 (not .cse5)) (.cse11 (= ~a12~0 8)) (.cse2 (= ~a21~0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse8 .cse2) (and .cse4 .cse9 .cse2 .cse3) (and .cse10 .cse6 .cse11 .cse7 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse12 .cse13 .cse11 .cse2 .cse14) (and .cse0 .cse9 .cse11 .cse2 .cse3) (and .cse6 .cse11 .cse7 .cse2 .cse15) (and .cse6 .cse4 .cse7 .cse2) (and .cse8 .cse2 (not .cse9) .cse15 .cse14) (and .cse5 .cse4 .cse16) (and .cse5 .cse9 .cse2) (and .cse0 .cse13 .cse11 .cse2 .cse16) (and .cse5 .cse0 .cse2 .cse14) (and .cse5 .cse9 .cse4) (and .cse12 .cse13 .cse11 .cse2 .cse16)))) [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,814 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:25,815 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:25,816 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:25,817 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:25,818 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:25,819 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,820 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:25,821 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:25,822 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:25,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:25 BoogieIcfgContainer [2018-10-24 14:51:25,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:25,851 INFO L168 Benchmark]: Toolchain (without parser) took 33061.71 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 1.9 GB in the end (delta: -463.4 MB). Peak memory consumption was 589.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,852 INFO L168 Benchmark]: CDTParser took 0.23 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-10-24 14:51:25,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.15 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,854 INFO L168 Benchmark]: Boogie Preprocessor took 70.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:25,855 INFO L168 Benchmark]: RCFGBuilder took 3030.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,856 INFO L168 Benchmark]: TraceAbstraction took 29033.75 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 342.4 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 168.2 MB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:25,861 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.23 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 706.15 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 213.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.3 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3030.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29033.75 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 342.4 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 168.2 MB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: (((((((((((((((((((!(a20 == 1) && !(a16 == 6)) && a21 == 1) && !(5 == a16)) && !(a8 == 15)) || (((a7 == 1 && a16 == 4) && !(a8 == 15)) && a17 <= 0)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || (((!(a8 == 15) && a17 == 1) && a21 == 1) && !(5 == a16))) || ((((a20 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && !(5 == a16))) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && !(5 == a16))) || ((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((a16 == 4 && !(a8 == 15)) && a17 <= 0) && a21 == 1)) || ((((a8 == 14 && a21 == 1) && !(a17 == 1)) && a20 <= 0) && a16 == 5)) || ((a7 == 1 && !(a8 == 15)) && a16 == 6)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && !(a20 == 1)) && a21 == 1) && a16 == 5)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(a20 == 1) && !(a16 == 6)) && a21 == 1) && !(5 == a16)) && !(a8 == 15)) || (((a7 == 1 && a16 == 4) && !(a8 == 15)) && a17 <= 0)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || (((!(a8 == 15) && a17 == 1) && a21 == 1) && !(5 == a16))) || ((((a20 == 1 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && !(a16 == 6)) && a21 == 1) && !(5 == a16))) || ((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && !(5 == a16))) || ((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((((!(1 == input) && a8 == 15) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || (((a16 == 4 && !(a8 == 15)) && a17 <= 0) && a21 == 1)) || ((((a8 == 14 && a21 == 1) && !(a17 == 1)) && a20 <= 0) && a16 == 5)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || ((a7 == 1 && !(a8 == 15)) && a16 == 6)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && !(a20 == 1)) && a21 == 1) && a16 == 5)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || (((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - 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, 28.9s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2196 SDtfs, 3986 SDslu, 832 SDs, 0 SdLazy, 8133 SolverSat, 1415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3790occurred in iteration=12, 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1123 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 107 NumberOfFragments, 550 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2583 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1144 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1740 ConstructedInterpolants, 0 QuantifiedInterpolants, 965512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 999/999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...