java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:48:07,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:48:07,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:48:07,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:48:07,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:48:07,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:48:07,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:48:07,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:48:07,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:48:07,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:48:07,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:48:07,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:48:07,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:48:07,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:48:07,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:48:07,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:48:07,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:48:07,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:48:07,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:48:07,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:48:07,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:48:07,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:48:07,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:48:07,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:48:07,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:48:07,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:48:07,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:48:07,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:48:07,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:48:07,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:48:07,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:48:07,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:48:07,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:48:07,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:48:07,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:48:07,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:48:07,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:48:07,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:48:07,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:48:07,472 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:48:07,472 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:48:07,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:48:07,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:48:07,473 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:48:07,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:48:07,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:48:07,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:48:07,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:48:07,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:48:07,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:48:07,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:48:07,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:48:07,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:48:07,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:48:07,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:48:07,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:48:07,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:48:07,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:48:07,478 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:48:07,480 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:48:07,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:48:07,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:48:07,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:48:07,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:48:07,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:48:07,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-06 19:48:07,650 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c2df9ef/c2540d2b9c9d41a3ac24740523ad02bf/FLAGd8e92206f [2018-11-06 19:48:08,202 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:48:08,206 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-06 19:48:08,230 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c2df9ef/c2540d2b9c9d41a3ac24740523ad02bf/FLAGd8e92206f [2018-11-06 19:48:08,251 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7c2df9ef/c2540d2b9c9d41a3ac24740523ad02bf [2018-11-06 19:48:08,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:48:08,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:48:08,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:48:08,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:48:08,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:48:08,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:48:08" (1/1) ... [2018-11-06 19:48:08,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedeeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:08, skipping insertion in model container [2018-11-06 19:48:08,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:48:08" (1/1) ... [2018-11-06 19:48:08,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:48:08,364 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:48:08,885 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:48:08,891 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:48:09,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:48:09,046 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:48:09,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09 WrapperNode [2018-11-06 19:48:09,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:48:09,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:48:09,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:48:09,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:48:09,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:48:09,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:48:09,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:48:09,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:48:09,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... [2018-11-06 19:48:09,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:48:09,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:48:09,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:48:09,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:48:09,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:48:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:48:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:48:09,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:48:12,702 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:48:12,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:12 BoogieIcfgContainer [2018-11-06 19:48:12,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:48:12,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:48:12,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:48:12,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:48:12,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:48:08" (1/3) ... [2018-11-06 19:48:12,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e1244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:12, skipping insertion in model container [2018-11-06 19:48:12,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:48:09" (2/3) ... [2018-11-06 19:48:12,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e1244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:12, skipping insertion in model container [2018-11-06 19:48:12,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:12" (3/3) ... [2018-11-06 19:48:12,712 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-11-06 19:48:12,723 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:48:12,733 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:48:12,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:48:12,789 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:48:12,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:48:12,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:48:12,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:48:12,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:48:12,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:48:12,791 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:48:12,792 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:48:12,792 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:48:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:48:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-06 19:48:12,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:12,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:12,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:12,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 995514023, now seen corresponding path program 1 times [2018-11-06 19:48:12,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:12,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:12,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:48:13,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:13,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:13,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:13,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:13,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:13,552 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:48:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:15,918 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-11-06 19:48:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:15,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-06 19:48:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:15,941 INFO L225 Difference]: With dead ends: 666 [2018-11-06 19:48:15,941 INFO L226 Difference]: Without dead ends: 460 [2018-11-06 19:48:15,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-06 19:48:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-06 19:48:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-11-06 19:48:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 19:48:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2018-11-06 19:48:16,020 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 95 [2018-11-06 19:48:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2018-11-06 19:48:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2018-11-06 19:48:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-06 19:48:16,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:16,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:16,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:16,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash 227515764, now seen corresponding path program 1 times [2018-11-06 19:48:16,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:48:16,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:16,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:16,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:16,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:16,144 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand 4 states. [2018-11-06 19:48:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:17,517 INFO L93 Difference]: Finished difference Result 1710 states and 2800 transitions. [2018-11-06 19:48:17,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:17,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-06 19:48:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:17,526 INFO L225 Difference]: With dead ends: 1710 [2018-11-06 19:48:17,526 INFO L226 Difference]: Without dead ends: 1252 [2018-11-06 19:48:17,530 INFO L604 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-11-06 19:48:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-11-06 19:48:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-11-06 19:48:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:48:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1863 transitions. [2018-11-06 19:48:17,588 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1863 transitions. Word has length 102 [2018-11-06 19:48:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:17,589 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1863 transitions. [2018-11-06 19:48:17,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1863 transitions. [2018-11-06 19:48:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-06 19:48:17,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:17,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:17,596 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:17,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -741187437, now seen corresponding path program 1 times [2018-11-06 19:48:17,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:17,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:17,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:17,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:17,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:48:17,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:17,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:17,750 INFO L87 Difference]: Start difference. First operand 1252 states and 1863 transitions. Second operand 3 states. [2018-11-06 19:48:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:20,485 INFO L93 Difference]: Finished difference Result 3418 states and 5040 transitions. [2018-11-06 19:48:20,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:20,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-06 19:48:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:20,497 INFO L225 Difference]: With dead ends: 3418 [2018-11-06 19:48:20,497 INFO L226 Difference]: Without dead ends: 2168 [2018-11-06 19:48:20,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-11-06 19:48:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2018-11-06 19:48:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2018-11-06 19:48:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2909 transitions. [2018-11-06 19:48:20,543 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2909 transitions. Word has length 103 [2018-11-06 19:48:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:20,544 INFO L480 AbstractCegarLoop]: Abstraction has 2168 states and 2909 transitions. [2018-11-06 19:48:20,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2909 transitions. [2018-11-06 19:48:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-06 19:48:20,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:20,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:20,550 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:20,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1481918287, now seen corresponding path program 1 times [2018-11-06 19:48:20,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:20,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:20,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:48:20,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:20,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:20,680 INFO L87 Difference]: Start difference. First operand 2168 states and 2909 transitions. Second operand 3 states. [2018-11-06 19:48:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:21,558 INFO L93 Difference]: Finished difference Result 4862 states and 6615 transitions. [2018-11-06 19:48:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:21,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-06 19:48:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:21,571 INFO L225 Difference]: With dead ends: 4862 [2018-11-06 19:48:21,571 INFO L226 Difference]: Without dead ends: 2696 [2018-11-06 19:48:21,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-11-06 19:48:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2696. [2018-11-06 19:48:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-06 19:48:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3630 transitions. [2018-11-06 19:48:21,625 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3630 transitions. Word has length 131 [2018-11-06 19:48:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:21,626 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 3630 transitions. [2018-11-06 19:48:21,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3630 transitions. [2018-11-06 19:48:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-06 19:48:21,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:21,632 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, 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] [2018-11-06 19:48:21,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:21,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1704669628, now seen corresponding path program 1 times [2018-11-06 19:48:21,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:21,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:48:21,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:21,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:21,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:21,750 INFO L87 Difference]: Start difference. First operand 2696 states and 3630 transitions. Second operand 3 states. [2018-11-06 19:48:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:22,503 INFO L93 Difference]: Finished difference Result 7634 states and 10229 transitions. [2018-11-06 19:48:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:22,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-11-06 19:48:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:22,526 INFO L225 Difference]: With dead ends: 7634 [2018-11-06 19:48:22,526 INFO L226 Difference]: Without dead ends: 4940 [2018-11-06 19:48:22,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-11-06 19:48:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-11-06 19:48:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-11-06 19:48:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6302 transitions. [2018-11-06 19:48:22,620 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6302 transitions. Word has length 155 [2018-11-06 19:48:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:22,620 INFO L480 AbstractCegarLoop]: Abstraction has 4940 states and 6302 transitions. [2018-11-06 19:48:22,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6302 transitions. [2018-11-06 19:48:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-06 19:48:22,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:22,629 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:48:22,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:22,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2127113900, now seen corresponding path program 1 times [2018-11-06 19:48:22,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-06 19:48:22,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:22,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:22,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:22,824 INFO L87 Difference]: Start difference. First operand 4940 states and 6302 transitions. Second operand 3 states. [2018-11-06 19:48:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:23,840 INFO L93 Difference]: Finished difference Result 9878 states and 12602 transitions. [2018-11-06 19:48:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:23,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2018-11-06 19:48:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:23,862 INFO L225 Difference]: With dead ends: 9878 [2018-11-06 19:48:23,862 INFO L226 Difference]: Without dead ends: 4940 [2018-11-06 19:48:23,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-11-06 19:48:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-11-06 19:48:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-11-06 19:48:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6230 transitions. [2018-11-06 19:48:23,943 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6230 transitions. Word has length 161 [2018-11-06 19:48:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:23,944 INFO L480 AbstractCegarLoop]: Abstraction has 4940 states and 6230 transitions. [2018-11-06 19:48:23,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6230 transitions. [2018-11-06 19:48:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:48:23,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:23,952 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:48:23,953 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:23,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1684111721, now seen corresponding path program 1 times [2018-11-06 19:48:23,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:23,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:48:24,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:24,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:48:24,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:24,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:24,097 INFO L87 Difference]: Start difference. First operand 4940 states and 6230 transitions. Second operand 3 states. [2018-11-06 19:48:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:24,791 INFO L93 Difference]: Finished difference Result 9878 states and 12458 transitions. [2018-11-06 19:48:24,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:24,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-11-06 19:48:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:24,813 INFO L225 Difference]: With dead ends: 9878 [2018-11-06 19:48:24,814 INFO L226 Difference]: Without dead ends: 4940 [2018-11-06 19:48:24,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-11-06 19:48:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-11-06 19:48:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-11-06 19:48:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6158 transitions. [2018-11-06 19:48:24,909 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6158 transitions. Word has length 180 [2018-11-06 19:48:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:24,909 INFO L480 AbstractCegarLoop]: Abstraction has 4940 states and 6158 transitions. [2018-11-06 19:48:24,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6158 transitions. [2018-11-06 19:48:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 19:48:24,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:24,919 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:48:24,919 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:24,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:24,920 INFO L82 PathProgramCache]: Analyzing trace with hash 6364353, now seen corresponding path program 1 times [2018-11-06 19:48:24,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:24,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:24,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:24,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:24,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:48:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:25,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:48:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:48:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:48:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:48:25,334 INFO L87 Difference]: Start difference. First operand 4940 states and 6158 transitions. Second operand 7 states. [2018-11-06 19:48:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:28,553 INFO L93 Difference]: Finished difference Result 9954 states and 12390 transitions. [2018-11-06 19:48:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:48:28,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2018-11-06 19:48:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:28,581 INFO L225 Difference]: With dead ends: 9954 [2018-11-06 19:48:28,581 INFO L226 Difference]: Without dead ends: 5016 [2018-11-06 19:48:28,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:48:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2018-11-06 19:48:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4940. [2018-11-06 19:48:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-11-06 19:48:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6134 transitions. [2018-11-06 19:48:28,670 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6134 transitions. Word has length 185 [2018-11-06 19:48:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:28,670 INFO L480 AbstractCegarLoop]: Abstraction has 4940 states and 6134 transitions. [2018-11-06 19:48:28,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:48:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6134 transitions. [2018-11-06 19:48:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-06 19:48:28,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:28,679 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:28,680 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:28,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 905871299, now seen corresponding path program 1 times [2018-11-06 19:48:28,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-06 19:48:28,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:28,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:48:28,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:48:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:48:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:28,922 INFO L87 Difference]: Start difference. First operand 4940 states and 6134 transitions. Second operand 3 states. [2018-11-06 19:48:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:30,250 INFO L93 Difference]: Finished difference Result 13306 states and 16358 transitions. [2018-11-06 19:48:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:48:30,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-11-06 19:48:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:30,269 INFO L225 Difference]: With dead ends: 13306 [2018-11-06 19:48:30,270 INFO L226 Difference]: Without dead ends: 8368 [2018-11-06 19:48:30,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:48:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2018-11-06 19:48:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8236. [2018-11-06 19:48:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-11-06 19:48:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 9844 transitions. [2018-11-06 19:48:30,393 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 9844 transitions. Word has length 202 [2018-11-06 19:48:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:30,394 INFO L480 AbstractCegarLoop]: Abstraction has 8236 states and 9844 transitions. [2018-11-06 19:48:30,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:48:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 9844 transitions. [2018-11-06 19:48:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-06 19:48:30,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:30,406 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2018-11-06 19:48:30,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:30,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2017222658, now seen corresponding path program 1 times [2018-11-06 19:48:30,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:30,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:30,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:30,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:30,911 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:48:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 19:48:30,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:30,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:48:30,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:30,945 INFO L87 Difference]: Start difference. First operand 8236 states and 9844 transitions. Second operand 4 states. [2018-11-06 19:48:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:33,170 INFO L93 Difference]: Finished difference Result 17268 states and 20691 transitions. [2018-11-06 19:48:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:33,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-11-06 19:48:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:33,188 INFO L225 Difference]: With dead ends: 17268 [2018-11-06 19:48:33,188 INFO L226 Difference]: Without dead ends: 9166 [2018-11-06 19:48:33,196 INFO L604 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-11-06 19:48:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2018-11-06 19:48:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 9166. [2018-11-06 19:48:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2018-11-06 19:48:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 10442 transitions. [2018-11-06 19:48:33,311 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 10442 transitions. Word has length 221 [2018-11-06 19:48:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:33,312 INFO L480 AbstractCegarLoop]: Abstraction has 9166 states and 10442 transitions. [2018-11-06 19:48:33,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 10442 transitions. [2018-11-06 19:48:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-06 19:48:33,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:33,325 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:33,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:33,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1747382289, now seen corresponding path program 1 times [2018-11-06 19:48:33,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-06 19:48:33,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:48:33,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:48:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:48:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:48:33,665 INFO L87 Difference]: Start difference. First operand 9166 states and 10442 transitions. Second operand 4 states. [2018-11-06 19:48:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:35,109 INFO L93 Difference]: Finished difference Result 18198 states and 20744 transitions. [2018-11-06 19:48:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:48:35,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-11-06 19:48:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:35,127 INFO L225 Difference]: With dead ends: 18198 [2018-11-06 19:48:35,127 INFO L226 Difference]: Without dead ends: 9166 [2018-11-06 19:48:35,136 INFO L604 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-11-06 19:48:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2018-11-06 19:48:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 9166. [2018-11-06 19:48:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2018-11-06 19:48:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 10418 transitions. [2018-11-06 19:48:35,238 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 10418 transitions. Word has length 227 [2018-11-06 19:48:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:35,238 INFO L480 AbstractCegarLoop]: Abstraction has 9166 states and 10418 transitions. [2018-11-06 19:48:35,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:48:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 10418 transitions. [2018-11-06 19:48:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-06 19:48:35,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:35,249 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:48:35,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:35,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash 255667232, now seen corresponding path program 1 times [2018-11-06 19:48:35,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:35,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-06 19:48:35,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:48:35,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:48:35,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:48:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:48:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:48:35,534 INFO L87 Difference]: Start difference. First operand 9166 states and 10418 transitions. Second operand 6 states. [2018-11-06 19:48:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:36,969 INFO L93 Difference]: Finished difference Result 18322 states and 20773 transitions. [2018-11-06 19:48:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:48:36,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-11-06 19:48:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:36,987 INFO L225 Difference]: With dead ends: 18322 [2018-11-06 19:48:36,987 INFO L226 Difference]: Without dead ends: 9290 [2018-11-06 19:48:36,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:48:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2018-11-06 19:48:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 8634. [2018-11-06 19:48:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8634 states. [2018-11-06 19:48:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 9637 transitions. [2018-11-06 19:48:37,111 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 9637 transitions. Word has length 249 [2018-11-06 19:48:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:37,111 INFO L480 AbstractCegarLoop]: Abstraction has 8634 states and 9637 transitions. [2018-11-06 19:48:37,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:48:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 9637 transitions. [2018-11-06 19:48:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-06 19:48:37,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:48:37,122 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:48:37,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:48:37,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:48:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 254713047, now seen corresponding path program 1 times [2018-11-06 19:48:37,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:48:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:48:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:48:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:37,722 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-11-06 19:48:37,937 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-06 19:48:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-06 19:48:38,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:48:38,410 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:48:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:48:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:48:38,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:48:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:48:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:48:38,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:48:38,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:48:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:48:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:48:38,942 INFO L87 Difference]: Start difference. First operand 8634 states and 9637 transitions. Second operand 14 states. [2018-11-06 19:48:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:48:47,236 INFO L93 Difference]: Finished difference Result 14663 states and 16308 transitions. [2018-11-06 19:48:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:48:47,237 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 271 [2018-11-06 19:48:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:48:47,237 INFO L225 Difference]: With dead ends: 14663 [2018-11-06 19:48:47,237 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:48:47,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:48:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:48:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:48:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:48:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:48:47,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 271 [2018-11-06 19:48:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:48:47,247 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:48:47,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:48:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:48:47,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:48:47,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:48:47,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,474 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 115 [2018-11-06 19:48:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:48:47,687 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 115 [2018-11-06 19:48:48,598 WARN L179 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-11-06 19:48:48,984 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,987 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:48:48,988 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:48:48,989 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:48:48,990 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,991 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:48:48,992 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:48:48,993 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse11 (= ~a7~0 1)) (.cse12 (= ~a8~0 13))) (let ((.cse9 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse10 (not .cse12)) (.cse0 (<= ~a21~0 0)) (.cse8 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse4 (not .cse3)) (.cse1 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse13 (not .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse2) (and .cse7 .cse1 .cse5 .cse6 .cse2) (and .cse7 (= ~a8~0 15) .cse1 .cse6) (and .cse1 (and .cse8 .cse9 .cse6 .cse10)) (and .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse11 .cse0 .cse12 .cse1 .cse5 .cse2) (and .cse1 .cse6 .cse13 .cse10 (= ~a16~0 5)) (and .cse11 .cse0 .cse8 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse12 .cse5 .cse1 (<= ~a20~0 0)) (and .cse7 .cse4 .cse1 .cse6 .cse13)))) [2018-11-06 19:48:48,993 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,993 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,993 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:48:48,994 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,995 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,996 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:48:48,997 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,998 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1)) (.cse3 (= ~a16~0 6)) (.cse11 (= ~a7~0 1)) (.cse12 (= ~a8~0 13))) (let ((.cse9 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1)) (.cse10 (not .cse12)) (.cse0 (<= ~a21~0 0)) (.cse8 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse4 (not .cse3)) (.cse1 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse13 (not .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse2) (and .cse7 .cse1 .cse5 .cse6 .cse2) (and .cse7 (= ~a8~0 15) .cse1 .cse6) (and .cse1 (and .cse8 .cse9 .cse6 .cse10)) (and .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse11 .cse0 .cse12 .cse1 .cse5 .cse2) (and .cse1 .cse6 .cse13 .cse10 (= ~a16~0 5)) (and .cse11 .cse0 .cse8 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse12 .cse5 .cse1 (<= ~a20~0 0)) (and .cse7 .cse4 .cse1 .cse6 .cse13)))) [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:48:48,999 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:48:49,000 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:48:49,001 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,002 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:48:49,003 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,004 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:48:49,005 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:48:49,006 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:48:49,007 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:48:49,008 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:48:49,008 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:48:49,008 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:48:49,008 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:48:49,008 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:48:49,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:48:49 BoogieIcfgContainer [2018-11-06 19:48:49,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:48:49,034 INFO L168 Benchmark]: Toolchain (without parser) took 40770.60 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -578.1 MB). Peak memory consumption was 626.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:49,036 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:48:49,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.49 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-11-06 19:48:49,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:49,038 INFO L168 Benchmark]: Boogie Preprocessor took 80.55 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-11-06 19:48:49,038 INFO L168 Benchmark]: RCFGBuilder took 3393.99 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: 117.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:49,039 INFO L168 Benchmark]: TraceAbstraction took 36328.63 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 480.8 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 543.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:48:49,044 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.49 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 177.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.55 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 3393.99 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: 117.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36328.63 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 480.8 MB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 543.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: (((((((((((a21 <= 0 && a12 == 8) && a20 == 1) && a16 == 6) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((a21 <= 0 && a16 == 4) && a12 == 8) && a17 <= 0) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0)) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a21 <= 0 && a12 == 8) && a20 == 1) && a16 == 6) || ((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((a21 <= 0 && a16 == 4) && a12 == 8) && a17 <= 0) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0)) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 36.2s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 28.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1818 SDtfs, 3635 SDslu, 968 SDs, 0 SdLazy, 9788 SolverSat, 1683 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 290 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9166occurred in iteration=10, 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 864 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 375 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5939 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 996 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2539 ConstructedInterpolants, 0 QuantifiedInterpolants, 1750117 SizeOfPredicates, 1 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 2256/2261 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...