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/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:50:24,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:50:24,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:50:24,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:50:24,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:50:24,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:50:24,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:50:24,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:50:24,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:50:24,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:50:24,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:50:24,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:50:24,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:50:24,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:50:24,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:50:24,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:50:24,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:50:24,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:50:24,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:50:24,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:50:24,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:50:24,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:50:24,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:50:24,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:50:24,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:50:24,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:50:24,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:50:24,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:50:24,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:50:24,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:50:24,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:50:24,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:50:24,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:50:24,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:50:24,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:50:24,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:50:24,708 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 22:50:24,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:50:24,724 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:50:24,725 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:50:24,725 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:50:24,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:50:24,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:50:24,726 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:50:24,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:50:24,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:50:24,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:50:24,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:50:24,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:50:24,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:50:24,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:50:24,727 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:50:24,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:50:24,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:50:24,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:50:24,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:50:24,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:50:24,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:50:24,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:50:24,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:50:24,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:50:24,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:50:24,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:50:24,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:50:24,730 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:50:24,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:50:24,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:50:24,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:50:24,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:50:24,803 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:50:24,804 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:24,864 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31fad121/863a536a88c84c79b155b87e240c16c5/FLAG12f003ea9 [2018-11-06 22:50:25,368 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:50:25,369 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:25,378 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31fad121/863a536a88c84c79b155b87e240c16c5/FLAG12f003ea9 [2018-11-06 22:50:25,394 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31fad121/863a536a88c84c79b155b87e240c16c5 [2018-11-06 22:50:25,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:50:25,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:50:25,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:25,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:50:25,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:50:25,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e69057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25, skipping insertion in model container [2018-11-06 22:50:25,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:50:25,459 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:50:25,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:25,676 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:50:25,713 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:25,728 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:50:25,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25 WrapperNode [2018-11-06 22:50:25,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:25,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:25,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:50:25,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:50:25,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:25,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:50:25,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:50:25,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:50:25,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (1/1) ... [2018-11-06 22:50:25,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:50:25,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:50:25,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:50:25,804 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:50:25,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (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 22:50:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:50:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:50:26,525 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:50:26,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:26 BoogieIcfgContainer [2018-11-06 22:50:26,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:50:26,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:50:26,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:50:26,531 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:50:26,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:25" (1/3) ... [2018-11-06 22:50:26,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7509044d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:26, skipping insertion in model container [2018-11-06 22:50:26,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:25" (2/3) ... [2018-11-06 22:50:26,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7509044d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:26, skipping insertion in model container [2018-11-06 22:50:26,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:26" (3/3) ... [2018-11-06 22:50:26,535 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:26,545 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:50:26,554 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-06 22:50:26,570 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-06 22:50:26,599 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:50:26,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:50:26,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:50:26,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:50:26,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:50:26,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:50:26,600 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:50:26,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:50:26,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:50:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-06 22:50:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-06 22:50:26,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:26,623 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:26,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:26,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2018-11-06 22:50:26,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:26,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:26,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:26,790 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 22:50:26,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:26,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:50:26,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:50:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:50:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:50:26,810 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-06 22:50:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:26,864 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-06 22:50:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:50:26,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-06 22:50:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:26,878 INFO L225 Difference]: With dead ends: 83 [2018-11-06 22:50:26,879 INFO L226 Difference]: Without dead ends: 72 [2018-11-06 22:50:26,882 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 22:50:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-06 22:50:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-11-06 22:50:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-06 22:50:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-06 22:50:26,927 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2018-11-06 22:50:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:26,927 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-06 22:50:26,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:50:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-06 22:50:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-06 22:50:26,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:26,929 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:26,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:26,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:26,930 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2018-11-06 22:50:26,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:26,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:26,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:27,170 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 22:50:27,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:27,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:27,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:27,173 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2018-11-06 22:50:27,443 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 22:50:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:27,660 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-06 22:50:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:27,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-06 22:50:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:27,662 INFO L225 Difference]: With dead ends: 73 [2018-11-06 22:50:27,662 INFO L226 Difference]: Without dead ends: 71 [2018-11-06 22:50:27,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-06 22:50:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2018-11-06 22:50:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-06 22:50:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-06 22:50:27,671 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2018-11-06 22:50:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:27,672 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-06 22:50:27,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-06 22:50:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-06 22:50:27,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:27,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:27,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2018-11-06 22:50:27,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:27,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:27,726 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 22:50:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:50:27,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:50:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:50:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:50:27,728 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2018-11-06 22:50:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:27,903 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-11-06 22:50:27,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:27,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-06 22:50:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:27,908 INFO L225 Difference]: With dead ends: 143 [2018-11-06 22:50:27,908 INFO L226 Difference]: Without dead ends: 93 [2018-11-06 22:50:27,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-06 22:50:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2018-11-06 22:50:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-06 22:50:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-06 22:50:27,925 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2018-11-06 22:50:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:27,926 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-06 22:50:27,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:50:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-06 22:50:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-06 22:50:27,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:27,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:27,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:27,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2018-11-06 22:50:27,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:27,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:28,082 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 22:50:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:28,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:28,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:28,084 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-06 22:50:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:28,492 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-11-06 22:50:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:28,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-06 22:50:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:28,494 INFO L225 Difference]: With dead ends: 94 [2018-11-06 22:50:28,494 INFO L226 Difference]: Without dead ends: 92 [2018-11-06 22:50:28,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-06 22:50:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 50. [2018-11-06 22:50:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-06 22:50:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-06 22:50:28,502 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2018-11-06 22:50:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:28,503 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-06 22:50:28,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-06 22:50:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:50:28,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:28,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:28,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:28,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2018-11-06 22:50:28,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:28,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:28,753 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 22:50:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:28,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:28,755 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-11-06 22:50:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:28,974 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-11-06 22:50:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:28,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-06 22:50:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:28,976 INFO L225 Difference]: With dead ends: 87 [2018-11-06 22:50:28,977 INFO L226 Difference]: Without dead ends: 85 [2018-11-06 22:50:28,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-06 22:50:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2018-11-06 22:50:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-06 22:50:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-06 22:50:28,985 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2018-11-06 22:50:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-06 22:50:28,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-06 22:50:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:50:28,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:28,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:28,988 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:28,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2018-11-06 22:50:28,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:28,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:28,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:29,121 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 22:50:29,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:29,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 22:50:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:50:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:50:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:29,123 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-11-06 22:50:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:29,742 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-06 22:50:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:50:29,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-11-06 22:50:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:29,745 INFO L225 Difference]: With dead ends: 89 [2018-11-06 22:50:29,745 INFO L226 Difference]: Without dead ends: 87 [2018-11-06 22:50:29,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:50:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-06 22:50:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2018-11-06 22:50:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-06 22:50:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-06 22:50:29,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2018-11-06 22:50:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:29,762 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-06 22:50:29,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:50:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-06 22:50:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:50:29,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:29,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:29,767 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:29,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2018-11-06 22:50:29,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:30,003 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 22:50:30,083 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 22:50:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:30,085 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-11-06 22:50:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:30,274 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-06 22:50:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:30,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-06 22:50:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:30,277 INFO L225 Difference]: With dead ends: 75 [2018-11-06 22:50:30,277 INFO L226 Difference]: Without dead ends: 73 [2018-11-06 22:50:30,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-06 22:50:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-06 22:50:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-06 22:50:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-06 22:50:30,285 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2018-11-06 22:50:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:30,285 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-06 22:50:30,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-06 22:50:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:50:30,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:30,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:30,287 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2018-11-06 22:50:30,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:30,505 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 22:50:30,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:30,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:30,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:30,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:30,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:30,507 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-11-06 22:50:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:30,775 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-06 22:50:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:30,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-06 22:50:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:30,777 INFO L225 Difference]: With dead ends: 85 [2018-11-06 22:50:30,778 INFO L226 Difference]: Without dead ends: 83 [2018-11-06 22:50:30,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-06 22:50:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2018-11-06 22:50:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-06 22:50:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-06 22:50:30,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-11-06 22:50:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-06 22:50:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-06 22:50:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-06 22:50:30,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:30,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:30,789 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:30,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2018-11-06 22:50:30,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:30,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:30,855 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 22:50:30,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:30,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:30,857 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-11-06 22:50:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,046 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-06 22:50:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:31,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-06 22:50:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,050 INFO L225 Difference]: With dead ends: 67 [2018-11-06 22:50:31,050 INFO L226 Difference]: Without dead ends: 65 [2018-11-06 22:50:31,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-06 22:50:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2018-11-06 22:50:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-06 22:50:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-06 22:50:31,058 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-11-06 22:50:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,058 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-06 22:50:31,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-06 22:50:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-06 22:50:31,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,060 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2018-11-06 22:50:31,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:31,150 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 22:50:31,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:31,151 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2018-11-06 22:50:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,275 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-06 22:50:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:31,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-06 22:50:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,277 INFO L225 Difference]: With dead ends: 67 [2018-11-06 22:50:31,277 INFO L226 Difference]: Without dead ends: 65 [2018-11-06 22:50:31,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-06 22:50:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2018-11-06 22:50:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-06 22:50:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-06 22:50:31,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-11-06 22:50:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,284 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-06 22:50:31,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-06 22:50:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-06 22:50:31,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,286 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2018-11-06 22:50:31,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:31,364 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 22:50:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:50:31,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:50:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:50:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:31,367 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-06 22:50:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,623 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-06 22:50:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:31,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-06 22:50:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,624 INFO L225 Difference]: With dead ends: 65 [2018-11-06 22:50:31,625 INFO L226 Difference]: Without dead ends: 63 [2018-11-06 22:50:31,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-06 22:50:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-11-06 22:50:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-06 22:50:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-06 22:50:31,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2018-11-06 22:50:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,633 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-06 22:50:31,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:50:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-06 22:50:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-06 22:50:31,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,635 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2018-11-06 22:50:31,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:31,755 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 22:50:31,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:31,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:31,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:31,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:31,757 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-06 22:50:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,938 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-06 22:50:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:31,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-06 22:50:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,940 INFO L225 Difference]: With dead ends: 86 [2018-11-06 22:50:31,940 INFO L226 Difference]: Without dead ends: 84 [2018-11-06 22:50:31,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-06 22:50:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 34. [2018-11-06 22:50:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-06 22:50:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-06 22:50:31,949 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2018-11-06 22:50:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,949 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-06 22:50:31,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-06 22:50:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 22:50:31,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,951 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2018-11-06 22:50:31,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,182 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 22:50:32,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:32,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 22:50:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:50:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:50:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:32,184 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2018-11-06 22:50:32,412 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 22:50:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:32,835 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-06 22:50:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:50:32,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-06 22:50:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:32,837 INFO L225 Difference]: With dead ends: 68 [2018-11-06 22:50:32,837 INFO L226 Difference]: Without dead ends: 66 [2018-11-06 22:50:32,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:50:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-06 22:50:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 32. [2018-11-06 22:50:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-06 22:50:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-06 22:50:32,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2018-11-06 22:50:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:32,847 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-06 22:50:32,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:50:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-06 22:50:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:50:32,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:32,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:32,849 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:32,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2018-11-06 22:50:32,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,961 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 22:50:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:32,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 22:50:32,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:50:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:50:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:32,962 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-11-06 22:50:33,755 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 22:50:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:34,285 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-06 22:50:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:50:34,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-06 22:50:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:34,286 INFO L225 Difference]: With dead ends: 103 [2018-11-06 22:50:34,286 INFO L226 Difference]: Without dead ends: 101 [2018-11-06 22:50:34,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:50:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-06 22:50:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 30. [2018-11-06 22:50:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-06 22:50:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-06 22:50:34,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2018-11-06 22:50:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:34,294 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-06 22:50:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:50:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-06 22:50:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-06 22:50:34,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:34,295 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] [2018-11-06 22:50:34,296 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:34,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2018-11-06 22:50:34,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:34,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:34,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:34,518 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 22:50:34,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 22:50:34,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:50:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:50:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:34,519 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-06 22:50:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:35,044 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-06 22:50:35,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:50:35,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-06 22:50:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:35,046 INFO L225 Difference]: With dead ends: 66 [2018-11-06 22:50:35,046 INFO L226 Difference]: Without dead ends: 64 [2018-11-06 22:50:35,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-06 22:50:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-06 22:50:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 28. [2018-11-06 22:50:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-06 22:50:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-06 22:50:35,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-11-06 22:50:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:35,053 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-06 22:50:35,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:50:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-06 22:50:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:50:35,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:35,054 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] [2018-11-06 22:50:35,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:35,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2018-11-06 22:50:35,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:35,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:35,136 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 22:50:35,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:35,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:50:35,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:50:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:50:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:35,137 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-11-06 22:50:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:35,522 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-06 22:50:35,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:35,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-06 22:50:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:35,523 INFO L225 Difference]: With dead ends: 82 [2018-11-06 22:50:35,523 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:50:35,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:50:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:50:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:50:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:50:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:50:35,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-06 22:50:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:35,525 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:50:35,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:50:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:50:35,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:50:35,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:50:35,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:35,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:35,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:35,729 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2018-11-06 22:50:35,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:35,839 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 14 [2018-11-06 22:50:35,980 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 72 [2018-11-06 22:50:37,655 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2018-11-06 22:50:37,917 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2018-11-06 22:50:37,920 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-11-06 22:50:37,920 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-11-06 22:50:37,920 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-11-06 22:50:37,920 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-06 22:50:37,921 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-11-06 22:50:37,921 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-11-06 22:50:37,921 INFO L421 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (and (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0)) .cse0) (<= 0 ULTIMATE.start_main_~main__i~0)) (let ((.cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (and (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse3))) (<= 1 ULTIMATE.start_main_~main__j~0)))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse0) (and .cse1 .cse0 .cse2)))))) [2018-11-06 22:50:37,921 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 22:50:37,921 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-11-06 22:50:37,922 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-11-06 22:50:37,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 22:50:37,924 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L421 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-06 22:50:37,925 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L428 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-06 22:50:37,926 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L421 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-06 22:50:37,927 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-11-06 22:50:37,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:50:37 BoogieIcfgContainer [2018-11-06 22:50:37,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:50:37,944 INFO L168 Benchmark]: Toolchain (without parser) took 12539.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 843.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.0 MB). Peak memory consumption was 604.4 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:37,948 INFO L168 Benchmark]: CDTParser took 0.23 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 22:50:37,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.51 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:37,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.39 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 22:50:37,950 INFO L168 Benchmark]: Boogie Preprocessor took 25.51 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 22:50:37,951 INFO L168 Benchmark]: RCFGBuilder took 722.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 688.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -703.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:37,951 INFO L168 Benchmark]: TraceAbstraction took 11415.71 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 154.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -146.5 MB). Peak memory consumption was 608.5 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:37,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.51 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.39 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. * Boogie Preprocessor took 25.51 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. * RCFGBuilder took 722.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 688.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -703.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11415.71 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 154.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -146.5 MB). Peak memory consumption was 608.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || ((!(__VERIFIER_assert__cond == 0) && ((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) || (((((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. SAFE Result, 11.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 703 SDtfs, 1740 SDslu, 714 SDs, 0 SdLazy, 1623 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 536 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 121 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3751018988 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1111887 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 12103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...