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/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:37:54,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:37:54,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:37:54,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:37:54,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:37:54,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:37:54,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:37:54,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:37:54,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:37:54,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:37:54,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:37:54,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:37:54,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:37:54,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:37:54,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:37:54,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:37:54,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:37:54,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:37:54,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:37:54,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:37:54,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:37:54,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:37:54,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:37:54,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:37:54,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:37:54,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:37:54,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:37:54,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:37:54,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:37:54,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:37:54,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:37:54,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:37:54,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:37:54,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:37:54,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:37:54,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:37:54,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:37:54,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:37:54,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:37:54,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:37:54,701 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:37:54,701 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:37:54,702 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:37:54,702 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:37:54,702 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:37:54,702 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:37:54,702 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:37:54,702 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:37:54,704 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:37:54,704 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:37:54,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:37:54,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:37:54,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:37:54,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:37:54,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:37:54,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:37:54,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:37:54,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:37:54,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:37:54,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:37:54,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:37:54,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:37:54,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:37:54,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:37:54,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:37:54,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:37:54,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:37:54,710 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:37:54,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:37:54,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:37:54,711 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:37:54,711 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:37:54,712 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:37:54,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:37:54,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:37:54,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:37:54,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:37:54,797 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:37:54,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:54,856 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92e4db6d/6a2af98fbe42421fa0383519e5d2e44a/FLAG835933d9c [2018-11-07 10:37:55,307 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:37:55,308 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:55,318 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92e4db6d/6a2af98fbe42421fa0383519e5d2e44a/FLAG835933d9c [2018-11-07 10:37:55,331 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92e4db6d/6a2af98fbe42421fa0383519e5d2e44a [2018-11-07 10:37:55,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:37:55,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:37:55,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:55,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:37:55,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:37:55,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214cbb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55, skipping insertion in model container [2018-11-07 10:37:55,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:37:55,414 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:37:55,701 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:55,706 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:37:55,782 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:37:55,805 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:37:55,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55 WrapperNode [2018-11-07 10:37:55,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:37:55,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:55,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:37:55,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:37:55,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:37:55,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:37:55,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:37:55,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:37:55,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (1/1) ... [2018-11-07 10:37:55,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:37:55,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:37:55,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:37:55,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:37:55,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (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-07 10:37:55,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:37:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:37:55,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:37:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:37:55,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:37:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:37:56,726 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:37:56,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:56 BoogieIcfgContainer [2018-11-07 10:37:56,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:37:56,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:37:56,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:37:56,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:37:56,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:37:55" (1/3) ... [2018-11-07 10:37:56,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e538d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:56, skipping insertion in model container [2018-11-07 10:37:56,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:55" (2/3) ... [2018-11-07 10:37:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e538d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:56, skipping insertion in model container [2018-11-07 10:37:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:56" (3/3) ... [2018-11-07 10:37:56,738 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 10:37:56,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:37:56,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-07 10:37:56,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-07 10:37:56,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:37:56,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:37:56,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:37:56,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:37:56,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:37:56,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:37:56,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:37:56,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:37:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-07 10:37:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:37:56,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:56,833 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-07 10:37:56,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:56,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-07 10:37:56,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:56,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:56,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:57,013 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-07 10:37:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:57,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:37:57,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:37:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:37:57,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:37:57,037 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-11-07 10:37:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:57,076 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-07 10:37:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:37:57,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 10:37:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:57,089 INFO L225 Difference]: With dead ends: 93 [2018-11-07 10:37:57,089 INFO L226 Difference]: Without dead ends: 80 [2018-11-07 10:37:57,092 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-07 10:37:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-07 10:37:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-07 10:37:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-07 10:37:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-07 10:37:57,134 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-07 10:37:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:57,134 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-07 10:37:57,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:37:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-07 10:37:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:37:57,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:57,136 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-07 10:37:57,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:57,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-07 10:37:57,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:57,324 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-07 10:37:57,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:57,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:57,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:57,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:57,327 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-11-07 10:37:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:57,693 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-07 10:37:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:37:57,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:37:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:57,696 INFO L225 Difference]: With dead ends: 80 [2018-11-07 10:37:57,696 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 10:37:57,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:37:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 10:37:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 10:37:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:37:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-07 10:37:57,707 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-07 10:37:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:57,708 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-07 10:37:57,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-07 10:37:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:37:57,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:57,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:57,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-07 10:37:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:57,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:57,923 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-07 10:37:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:57,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:57,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:57,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:57,926 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-11-07 10:37:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:58,161 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-07 10:37:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:37:58,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 10:37:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:58,167 INFO L225 Difference]: With dead ends: 116 [2018-11-07 10:37:58,167 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 10:37:58,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:37:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 10:37:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-11-07 10:37:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:37:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-07 10:37:58,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-07 10:37:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:58,179 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-07 10:37:58,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-07 10:37:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:37:58,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:58,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:58,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:58,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-07 10:37:58,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:58,334 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-07 10:37:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:37:58,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:58,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:37:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:37:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:37:58,337 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-07 10:37:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:58,769 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-07 10:37:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:37:58,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-07 10:37:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:58,771 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:37:58,771 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 10:37:58,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:37:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 10:37:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-07 10:37:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 10:37:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-07 10:37:58,780 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-07 10:37:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-07 10:37:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:37:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-07 10:37:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:37:58,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:58,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:58,783 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-07 10:37:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:58,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:58,879 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-07 10:37:58,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:58,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:58,880 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:58,881 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-07 10:37:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:59,341 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-07 10:37:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:59,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-07 10:37:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:59,346 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:37:59,346 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 10:37:59,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:37:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 10:37:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-11-07 10:37:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 10:37:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-07 10:37:59,362 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-07 10:37:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:59,363 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-07 10:37:59,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-07 10:37:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 10:37:59,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:59,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:59,365 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:59,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-07 10:37:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:59,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:59,460 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-07 10:37:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:59,461 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:59,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:59,462 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-07 10:37:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:37:59,693 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-07 10:37:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:37:59,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-07 10:37:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:37:59,696 INFO L225 Difference]: With dead ends: 108 [2018-11-07 10:37:59,696 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 10:37:59,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:37:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 10:37:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-07 10:37:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 10:37:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-07 10:37:59,706 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-07 10:37:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:37:59,706 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-07 10:37:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:37:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-07 10:37:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:37:59,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:37:59,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:37:59,709 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:37:59,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:37:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-07 10:37:59,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:37:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:59,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:37:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:37:59,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:37:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:37:59,912 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 10:37:59,936 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-07 10:37:59,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:37:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:37:59,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:37:59,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:37:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:37:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:37:59,939 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-07 10:38:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:00,100 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-11-07 10:38:00,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:38:00,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 10:38:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:00,103 INFO L225 Difference]: With dead ends: 121 [2018-11-07 10:38:00,103 INFO L226 Difference]: Without dead ends: 119 [2018-11-07 10:38:00,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-07 10:38:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-11-07 10:38:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 10:38:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-07 10:38:00,115 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-11-07 10:38:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:00,115 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-07 10:38:00,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-07 10:38:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:38:00,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:00,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:00,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-07 10:38:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:00,225 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-07 10:38:00,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:00,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:00,226 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:00,227 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-07 10:38:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:00,386 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-07 10:38:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:38:00,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 10:38:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:00,388 INFO L225 Difference]: With dead ends: 77 [2018-11-07 10:38:00,388 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 10:38:00,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 10:38:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-07 10:38:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 10:38:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-07 10:38:00,396 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-11-07 10:38:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:00,396 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-07 10:38:00,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-07 10:38:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:38:00,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:00,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:00,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:00,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-07 10:38:00,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:00,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:00,474 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-07 10:38:00,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:38:00,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:00,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:38:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:38:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:38:00,476 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-11-07 10:38:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:00,526 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-07 10:38:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:38:00,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-07 10:38:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:00,531 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:38:00,532 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 10:38:00,532 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-07 10:38:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 10:38:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-07 10:38:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 10:38:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-07 10:38:00,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-11-07 10:38:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:00,539 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-07 10:38:00,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:38:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-07 10:38:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 10:38:00,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:00,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:00,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:00,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-07 10:38:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:00,641 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-07 10:38:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:38:00,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:00,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:38:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:38:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:00,643 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-11-07 10:38:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:00,791 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-07 10:38:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:00,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-07 10:38:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:00,794 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:38:00,794 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 10:38:00,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:38:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 10:38:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-07 10:38:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 10:38:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-07 10:38:00,802 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-11-07 10:38:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:00,803 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-07 10:38:00,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:38:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-07 10:38:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 10:38:00,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:00,804 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:00,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:00,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-07 10:38:00,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:00,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:00,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:00,920 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:00,921 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-07 10:38:00,923 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [192], [195], [196], [198], [204], [214], [215], [216] [2018-11-07 10:38:00,961 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:38:00,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:38:01,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:38:01,193 INFO L272 AbstractInterpreter]: Visited 28 different actions 34 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 10:38:01,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:01,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:38:01,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:01,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:01,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:01,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:01,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:01,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:01,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-07 10:38:01,560 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:01,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:38:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:38:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:38:01,561 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-11-07 10:38:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:01,858 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-07 10:38:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:01,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-07 10:38:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:01,859 INFO L225 Difference]: With dead ends: 111 [2018-11-07 10:38:01,860 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 10:38:01,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:38:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 10:38:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-11-07 10:38:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 10:38:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-07 10:38:01,875 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-11-07 10:38:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:01,875 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-07 10:38:01,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:38:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-07 10:38:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:38:01,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:01,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:01,882 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-07 10:38:01,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:01,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:02,004 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-07 10:38:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:02,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:38:02,005 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:02,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:38:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:38:02,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:38:02,007 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-11-07 10:38:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:02,125 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-07 10:38:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:02,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-07 10:38:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:02,126 INFO L225 Difference]: With dead ends: 70 [2018-11-07 10:38:02,127 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 10:38:02,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:38:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 10:38:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-07 10:38:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:38:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-07 10:38:02,134 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-11-07 10:38:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-07 10:38:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:38:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-07 10:38:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:38:02,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:02,136 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:02,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:02,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-07 10:38:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:02,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:02,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:02,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:02,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 10:38:02,246 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [85], [86], [192], [198], [204], [214], [215], [216] [2018-11-07 10:38:02,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:38:02,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:38:02,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:38:02,329 INFO L272 AbstractInterpreter]: Visited 30 different actions 38 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-07 10:38:02,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:02,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:38:02,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:02,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:02,373 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:02,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:02,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:38:02,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:02,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-07 10:38:02,903 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:02,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:38:02,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:38:02,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:38:02,904 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-11-07 10:38:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:03,115 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-07 10:38:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:03,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-07 10:38:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:03,117 INFO L225 Difference]: With dead ends: 69 [2018-11-07 10:38:03,117 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:38:03,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:38:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:38:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-07 10:38:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 10:38:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-07 10:38:03,123 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-11-07 10:38:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:03,123 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-07 10:38:03,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:38:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-07 10:38:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 10:38:03,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:03,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:03,125 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:03,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-07 10:38:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:03,399 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-07 10:38:03,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:03,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:38:03,400 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:03,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:38:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:38:03,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:03,402 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-11-07 10:38:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:03,551 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-07 10:38:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:03,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-07 10:38:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:03,552 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:38:03,552 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 10:38:03,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:38:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 10:38:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 10:38:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:38:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-07 10:38:03,556 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-07 10:38:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:03,556 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-07 10:38:03,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:38:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-07 10:38:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:38:03,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:03,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:03,558 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:03,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-07 10:38:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:03,738 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-07 10:38:03,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:38:03,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:03,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:38:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:38:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:03,740 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-11-07 10:38:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:03,882 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-07 10:38:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:38:03,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-07 10:38:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:03,884 INFO L225 Difference]: With dead ends: 71 [2018-11-07 10:38:03,885 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:38:03,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:38:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:38:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-07 10:38:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 10:38:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-07 10:38:03,890 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-11-07 10:38:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:03,891 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-07 10:38:03,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:38:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-07 10:38:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 10:38:03,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:03,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:03,892 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:03,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-07 10:38:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:03,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:03,986 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-07 10:38:03,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:03,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:03,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:03,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:03,988 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-11-07 10:38:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:04,225 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-07 10:38:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:38:04,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-07 10:38:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:04,226 INFO L225 Difference]: With dead ends: 91 [2018-11-07 10:38:04,226 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 10:38:04,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 10:38:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-11-07 10:38:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 10:38:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-07 10:38:04,235 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-11-07 10:38:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:04,235 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-07 10:38:04,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-07 10:38:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:38:04,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:04,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:04,237 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:04,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-07 10:38:04,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:04,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:04,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:04,454 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 10:38:04,545 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-07 10:38:04,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:04,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:04,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:04,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:04,547 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-11-07 10:38:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:04,667 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-07 10:38:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:38:04,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-07 10:38:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:04,669 INFO L225 Difference]: With dead ends: 61 [2018-11-07 10:38:04,669 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 10:38:04,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 10:38:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-07 10:38:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 10:38:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-07 10:38:04,676 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-11-07 10:38:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:04,676 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-07 10:38:04,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-07 10:38:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:38:04,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:04,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:04,678 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:04,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-07 10:38:04,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:04,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:04,968 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-07 10:38:04,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:04,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:04,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:04,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:04,970 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-11-07 10:38:05,235 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:38:05,407 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 10:38:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:05,455 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-07 10:38:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:05,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-07 10:38:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:05,457 INFO L225 Difference]: With dead ends: 70 [2018-11-07 10:38:05,457 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 10:38:05,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:38:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 10:38:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-07 10:38:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 10:38:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-07 10:38:05,465 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-11-07 10:38:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:05,465 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-07 10:38:05,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-07 10:38:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 10:38:05,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:05,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:05,467 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-11-07 10:38:05,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:05,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:05,878 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-07 10:38:05,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:38:05,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:05,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:38:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:38:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:38:05,880 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-07 10:38:06,111 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 10:38:06,349 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 10:38:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:06,473 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-07 10:38:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:06,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-07 10:38:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:06,475 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:38:06,475 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 10:38:06,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:38:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 10:38:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-07 10:38:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 10:38:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-07 10:38:06,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-11-07 10:38:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:06,482 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-07 10:38:06,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:38:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-07 10:38:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 10:38:06,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:06,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:06,484 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:06,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-11-07 10:38:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:06,682 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:38:06,692 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-07 10:38:06,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:06,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:06,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:06,694 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-07 10:38:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:06,873 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-07 10:38:06,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:38:06,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-07 10:38:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:06,875 INFO L225 Difference]: With dead ends: 88 [2018-11-07 10:38:06,875 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 10:38:06,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 10:38:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-07 10:38:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:38:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-07 10:38:06,882 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-11-07 10:38:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:06,882 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-07 10:38:06,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-07 10:38:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:38:06,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:06,883 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:06,884 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-11-07 10:38:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:06,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:07,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:38:07,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-07 10:38:07,137 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [142], [143], [145], [151], [180], [182], [214], [215], [216] [2018-11-07 10:38:07,141 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:38:07,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:38:07,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:38:07,225 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-11-07 10:38:07,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:07,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:38:07,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:38:07,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:38:07,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:07,267 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:38:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:07,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:38:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:07,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:38:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:38:07,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:38:07,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-07 10:38:07,536 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:38:07,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:38:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:38:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:38:07,537 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-11-07 10:38:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:07,657 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-07 10:38:07,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:38:07,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-07 10:38:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:07,658 INFO L225 Difference]: With dead ends: 60 [2018-11-07 10:38:07,658 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:38:07,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:38:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:38:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-07 10:38:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 10:38:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-07 10:38:07,668 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-11-07 10:38:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:07,668 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-07 10:38:07,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:38:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-07 10:38:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:38:07,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:07,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:07,670 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:07,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-11-07 10:38:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:07,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:07,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:07,802 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-07 10:38:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:07,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:07,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:07,803 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-11-07 10:38:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:07,975 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-07 10:38:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:38:07,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-07 10:38:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:07,979 INFO L225 Difference]: With dead ends: 69 [2018-11-07 10:38:07,979 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:38:07,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:38:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:38:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-07 10:38:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 10:38:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-07 10:38:07,985 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-11-07 10:38:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:07,985 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-07 10:38:07,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-07 10:38:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 10:38:07,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:38:07,986 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:38:07,986 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:38:07,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:38:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-11-07 10:38:07,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:38:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:07,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:38:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:38:07,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:38:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:38:08,170 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:38:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:38:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:38:08,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:38:08,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:38:08,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:38:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:38:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:38:08,228 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-07 10:38:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:38:08,398 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-07 10:38:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:38:08,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-07 10:38:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:38:08,399 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:38:08,399 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:38:08,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:38:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:38:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:38:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:38:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:38:08,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-07 10:38:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:38:08,401 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:38:08,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:38:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:38:08,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:38:08,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:38:08,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:38:08,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:38:08,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:38:08,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:38:09,760 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-11-07 10:38:09,943 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-11-07 10:38:10,378 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2018-11-07 10:38:10,569 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-11-07 10:38:10,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:38:10,601 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:38:10,601 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:38:10,601 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:38:10,601 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:38:10,601 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:38:10,601 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:38:10,601 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-07 10:38:10,602 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-07 10:38:10,603 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-07 10:38:10,604 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L421 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (<= 2 main_~main__cp~0)) (.cse1 (= main_~main__c~0 0)) (.cse3 (= main_~__VERIFIER_assert__cond~9 1)) (.cse4 (and (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (<= 1 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1)) (not (= 0 main_~__VERIFIER_assert__cond~8))))) (or (and (let ((.cse0 (let ((.cse5 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse1 .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) (and .cse2 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse1 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~8 1)))) [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-07 10:38:10,605 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-07 10:38:10,606 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-07 10:38:10,607 INFO L421 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (not (= 0 main_~__VERIFIER_assert__cond~17)) (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-07 10:38:10,608 INFO L421 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 main_~main__cp~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse2 .cse3) (and (= main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0)) [2018-11-07 10:38:10,608 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L421 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (<= 2 main_~main__cp~0)) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse5 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse6 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse7 (not (= 0 main_~__VERIFIER_assert__cond~11))) (.cse8 (= main_~__VERIFIER_assert__cond~9 1)) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (= main_~__VERIFIER_assert__cond~0 1)) (.cse11 (= main_~__VERIFIER_assert__cond~4 1)) (.cse12 (<= 1 main_~main__scheme~0)) (.cse13 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse14 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 main_~__VERIFIER_assert__cond~12)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse0 (= main_~main__c~0 0))))) [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-07 10:38:10,609 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-07 10:38:10,610 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-07 10:38:10,611 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-07 10:38:10,611 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-07 10:38:10,611 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-07 10:38:10,611 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-07 10:38:10,611 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-07 10:38:10,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:38:10 BoogieIcfgContainer [2018-11-07 10:38:10,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:38:10,637 INFO L168 Benchmark]: Toolchain (without parser) took 15296.75 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 865.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -583.4 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:38:10,638 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:38:10,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.69 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-07 10:38:10,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.20 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:38:10,640 INFO L168 Benchmark]: Boogie Preprocessor took 31.53 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-07 10:38:10,640 INFO L168 Benchmark]: RCFGBuilder took 866.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:38:10,644 INFO L168 Benchmark]: TraceAbstraction took 13908.35 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 159.2 MB). Peak memory consumption was 300.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:38:10,650 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 463.69 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 22.20 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.53 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 866.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13908.35 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 159.2 MB). Peak memory consumption was 300.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: 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: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))))) && __VERIFIER_assert__cond == 1) || (((((2 <= main__cp && main__cp + 2 <= main__urilen) && main__c == 0) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__cp < main__urilen - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || ((((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))) && main__c == 0)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 13.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2961 SDslu, 1868 SDs, 0 SdLazy, 1141 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 248 SyntacticMatches, 16 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 685 HoareAnnotationTreeSize, 9 FomulaSimplifications, 326253 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 80271 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 71718 SizeOfPredicates, 27 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...