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.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:06:22,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:06:22,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:06:22,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:06:22,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:06:22,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:06:22,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:06:22,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:06:22,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:06:22,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:06:22,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:06:22,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:06:22,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:06:22,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:06:22,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:06:22,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:06:22,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:06:22,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:06:22,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:06:22,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:06:22,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:06:22,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:06:22,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:06:22,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:06:22,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:06:22,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:06:22,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:06:22,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:06:22,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:06:22,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:06:22,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:06:22,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:06:22,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:06:22,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:06:22,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:06:22,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:06:22,786 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:06:22,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:06:22,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:06:22,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:06:22,815 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:06:22,815 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:06:22,815 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:06:22,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:06:22,816 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:06:22,816 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:06:22,816 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:06:22,816 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:06:22,817 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:06:22,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:06:22,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:06:22,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:06:22,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:06:22,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:06:22,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:06:22,819 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:06:22,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:06:22,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:06:22,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:06:22,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:06:22,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:06:22,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:06:22,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:06:22,820 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:06:22,820 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:06:22,821 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:06:22,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:06:22,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:06:22,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:06:22,821 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:06:22,822 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:06:22,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:06:22,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:06:22,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:06:22,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:06:22,884 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:06:22,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-07 05:06:22,952 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcc24632/f337c17fdc5942dab3c7c1ece62c90fe/FLAG09234931c [2018-11-07 05:06:23,447 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:06:23,448 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-07 05:06:23,464 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcc24632/f337c17fdc5942dab3c7c1ece62c90fe/FLAG09234931c [2018-11-07 05:06:23,483 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcc24632/f337c17fdc5942dab3c7c1ece62c90fe [2018-11-07 05:06:23,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:06:23,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:06:23,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:06:23,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:06:23,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:06:23,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121926f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23, skipping insertion in model container [2018-11-07 05:06:23,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:06:23,563 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:06:23,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:06:23,818 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:06:23,869 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:06:23,893 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:06:23,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23 WrapperNode [2018-11-07 05:06:23,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:06:23,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:06:23,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:06:23,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:06:23,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:06:23,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:06:23,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:06:23,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:06:23,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (1/1) ... [2018-11-07 05:06:23,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:06:23,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:06:23,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:06:23,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:06:23,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (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 05:06:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:06:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:06:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:06:24,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:06:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:06:24,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:06:24,844 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:06:24,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:24 BoogieIcfgContainer [2018-11-07 05:06:24,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:06:24,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:06:24,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:06:24,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:06:24,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:06:23" (1/3) ... [2018-11-07 05:06:24,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748b5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:24, skipping insertion in model container [2018-11-07 05:06:24,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:23" (2/3) ... [2018-11-07 05:06:24,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748b5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:24, skipping insertion in model container [2018-11-07 05:06:24,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:24" (3/3) ... [2018-11-07 05:06:24,854 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-07 05:06:24,864 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:06:24,873 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-07 05:06:24,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-07 05:06:24,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:06:24,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:06:24,928 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:06:24,928 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:06:24,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:06:24,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:06:24,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:06:24,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:06:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-07 05:06:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 05:06:24,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:24,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:24,963 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:24,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-11-07 05:06:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:25,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:25,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:25,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:25,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:25,240 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 05:06:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:06:25,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:25,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:06:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:06:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:06:25,264 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2018-11-07 05:06:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:25,850 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-11-07 05:06:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:25,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-07 05:06:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:25,863 INFO L225 Difference]: With dead ends: 127 [2018-11-07 05:06:25,863 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 05:06:25,866 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 05:06:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 05:06:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-11-07 05:06:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 05:06:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-07 05:06:25,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-11-07 05:06:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:25,910 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-07 05:06:25,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:06:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-07 05:06:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 05:06:25,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:25,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:25,913 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:25,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-11-07 05:06:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:25,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:25,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:26,032 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 05:06:26,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:26,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:06:26,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:26,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:06:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:06:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:06:26,035 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-11-07 05:06:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:26,251 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-07 05:06:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:26,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-07 05:06:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:26,255 INFO L225 Difference]: With dead ends: 111 [2018-11-07 05:06:26,255 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 05:06:26,257 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 05:06:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 05:06:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-11-07 05:06:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 05:06:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-07 05:06:26,269 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-07 05:06:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-07 05:06:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:06:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-07 05:06:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:06:26,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:26,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:26,272 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:26,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-11-07 05:06:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:26,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:26,546 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 05:06:26,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:26,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:26,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:26,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:26,552 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-11-07 05:06:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:26,917 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-07 05:06:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:26,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 05:06:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:26,921 INFO L225 Difference]: With dead ends: 109 [2018-11-07 05:06:26,921 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 05:06:26,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 05:06:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-11-07 05:06:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 05:06:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-07 05:06:26,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-11-07 05:06:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:26,932 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-07 05:06:26,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-07 05:06:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:06:26,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:26,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:26,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:26,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-11-07 05:06:26,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:26,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:26,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:27,029 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 05:06:27,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:27,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:27,030 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:27,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:27,031 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-11-07 05:06:27,452 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-07 05:06:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:27,614 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-11-07 05:06:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:27,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 05:06:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:27,616 INFO L225 Difference]: With dead ends: 105 [2018-11-07 05:06:27,616 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 05:06:27,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 05:06:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-11-07 05:06:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 05:06:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-07 05:06:27,626 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2018-11-07 05:06:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:27,626 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-07 05:06:27,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-07 05:06:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:06:27,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:27,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:27,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:27,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-11-07 05:06:27,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:27,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:27,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:27,729 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 05:06:27,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:27,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:27,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:27,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:27,730 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-11-07 05:06:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:28,031 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-11-07 05:06:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:28,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 05:06:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:28,033 INFO L225 Difference]: With dead ends: 150 [2018-11-07 05:06:28,034 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 05:06:28,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 05:06:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 65. [2018-11-07 05:06:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 05:06:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-07 05:06:28,043 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2018-11-07 05:06:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:28,044 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-07 05:06:28,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-07 05:06:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:06:28,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:28,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:28,046 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:28,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-11-07 05:06:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:28,146 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 05:06:28,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:28,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:28,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:28,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:28,149 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-07 05:06:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:28,332 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-07 05:06:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:28,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 05:06:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:28,334 INFO L225 Difference]: With dead ends: 101 [2018-11-07 05:06:28,334 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 05:06:28,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 05:06:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-11-07 05:06:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 05:06:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-07 05:06:28,344 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2018-11-07 05:06:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:28,345 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-07 05:06:28,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-07 05:06:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:06:28,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:28,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:28,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:28,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:28,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-11-07 05:06:28,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:28,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:28,416 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 05:06:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:28,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:28,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:28,419 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-07 05:06:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:28,678 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-07 05:06:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:28,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 05:06:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:28,679 INFO L225 Difference]: With dead ends: 99 [2018-11-07 05:06:28,679 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 05:06:28,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:06:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 05:06:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-11-07 05:06:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 05:06:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-07 05:06:28,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2018-11-07 05:06:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:28,688 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-07 05:06:28,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-07 05:06:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:06:28,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:28,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:28,690 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-11-07 05:06:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:28,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:28,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:28,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:28,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:28,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:28,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:28,756 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-11-07 05:06:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:28,930 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-07 05:06:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:28,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 05:06:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:28,931 INFO L225 Difference]: With dead ends: 93 [2018-11-07 05:06:28,932 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 05:06:28,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 05:06:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2018-11-07 05:06:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 05:06:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-07 05:06:28,943 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2018-11-07 05:06:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:28,943 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-07 05:06:28,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-07 05:06:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:28,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:28,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:28,947 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:28,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-11-07 05:06:28,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:28,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:29,128 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 05:06:29,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:29,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 05:06:29,129 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:29,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:29,130 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2018-11-07 05:06:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:29,342 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-07 05:06:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:29,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 05:06:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:29,347 INFO L225 Difference]: With dead ends: 94 [2018-11-07 05:06:29,348 INFO L226 Difference]: Without dead ends: 92 [2018-11-07 05:06:29,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-07 05:06:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2018-11-07 05:06:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 05:06:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-07 05:06:29,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-11-07 05:06:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-07 05:06:29,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-07 05:06:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:29,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:29,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:29,357 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:29,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-11-07 05:06:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:29,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:29,670 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 05:06:29,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:29,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 05:06:29,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:29,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:29,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:29,672 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2018-11-07 05:06:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:30,017 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-07 05:06:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:30,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 05:06:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:30,019 INFO L225 Difference]: With dead ends: 85 [2018-11-07 05:06:30,019 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 05:06:30,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 05:06:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-11-07 05:06:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 05:06:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-07 05:06:30,028 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-11-07 05:06:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:30,028 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-07 05:06:30,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-07 05:06:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:30,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:30,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:30,030 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:30,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-11-07 05:06:30,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:30,120 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 05:06:30,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:30,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:30,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:30,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:30,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:30,122 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-11-07 05:06:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:30,536 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-07 05:06:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:30,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:06:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:30,537 INFO L225 Difference]: With dead ends: 115 [2018-11-07 05:06:30,537 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 05:06:30,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 05:06:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 49. [2018-11-07 05:06:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 05:06:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-07 05:06:30,544 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2018-11-07 05:06:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:30,544 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-07 05:06:30,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-07 05:06:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:30,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:30,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:30,546 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:30,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-11-07 05:06:30,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:30,617 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 05:06:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:30,618 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:30,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:30,619 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-11-07 05:06:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:30,780 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-07 05:06:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:30,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:06:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:30,782 INFO L225 Difference]: With dead ends: 77 [2018-11-07 05:06:30,783 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 05:06:30,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 05:06:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-11-07 05:06:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 05:06:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-07 05:06:30,790 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-11-07 05:06:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:30,791 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-07 05:06:30,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-07 05:06:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:30,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:30,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:30,793 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:30,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-11-07 05:06:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:30,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:30,853 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 05:06:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:30,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:30,854 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:30,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:30,855 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-07 05:06:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:31,258 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-07 05:06:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:31,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 05:06:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:31,259 INFO L225 Difference]: With dead ends: 113 [2018-11-07 05:06:31,260 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 05:06:31,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 05:06:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 45. [2018-11-07 05:06:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 05:06:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 05:06:31,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-07 05:06:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:31,267 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 05:06:31,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 05:06:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:31,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:31,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:31,269 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:31,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-11-07 05:06:31,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:31,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:31,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:31,390 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 05:06:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 05:06:31,391 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:31,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:31,393 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-11-07 05:06:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:31,782 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-07 05:06:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:31,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-07 05:06:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:31,784 INFO L225 Difference]: With dead ends: 60 [2018-11-07 05:06:31,784 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:06:31,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:06:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-07 05:06:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 05:06:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 05:06:31,791 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-07 05:06:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:31,791 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 05:06:31,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 05:06:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:31,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:31,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:31,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:31,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-11-07 05:06:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:31,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:31,911 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 05:06:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 05:06:31,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:31,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:31,912 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-11-07 05:06:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:32,312 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-07 05:06:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:32,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-07 05:06:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:32,313 INFO L225 Difference]: With dead ends: 44 [2018-11-07 05:06:32,313 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 05:06:32,314 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:06:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 05:06:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 05:06:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 05:06:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-07 05:06:32,321 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-07 05:06:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:32,322 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-07 05:06:32,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-07 05:06:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:06:32,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:32,323 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 05:06:32,323 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:32,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:32,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-11-07 05:06:32,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:32,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:32,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:32,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:32,484 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 05:06:32,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:32,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 05:06:32,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:32,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:32,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:32,486 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-11-07 05:06:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:32,696 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-07 05:06:32,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:32,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-07 05:06:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:32,698 INFO L225 Difference]: With dead ends: 55 [2018-11-07 05:06:32,698 INFO L226 Difference]: Without dead ends: 53 [2018-11-07 05:06:32,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-07 05:06:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-11-07 05:06:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 05:06:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-07 05:06:32,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-07 05:06:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:32,705 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-07 05:06:32,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-07 05:06:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:06:32,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:32,706 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 05:06:32,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:32,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-11-07 05:06:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:32,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:33,149 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 05:06:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 05:06:33,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:33,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:06:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:06:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 05:06:33,150 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-07 05:06:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:33,281 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-07 05:06:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:33,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 05:06:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:33,282 INFO L225 Difference]: With dead ends: 53 [2018-11-07 05:06:33,283 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 05:06:33,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 05:06:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-07 05:06:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 05:06:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-07 05:06:33,290 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2018-11-07 05:06:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:33,290 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-07 05:06:33,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:06:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-07 05:06:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:06:33,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:33,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:33,291 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:33,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-11-07 05:06:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:33,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:33,623 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 05:06:33,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:33,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:33,624 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:33,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:33,626 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-07 05:06:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:34,269 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-07 05:06:34,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:34,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 05:06:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:34,272 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:06:34,273 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:06:34,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:06:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:06:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:06:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:06:34,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-07 05:06:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:34,275 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:06:34,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:06:34,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:06:34,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:06:34,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:06:34,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:06:34,626 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 05:06:34,819 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-07 05:06:34,974 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-07 05:06:36,105 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:06:36,108 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-11-07 05:06:36,108 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-11-07 05:06:36,109 INFO L428 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-11-07 05:06:36,109 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-11-07 05:06:36,110 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L421 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 05:06:36,111 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-11-07 05:06:36,112 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-11-07 05:06:36,113 INFO L421 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-07 05:06:36,113 INFO L421 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (or (<= 1 main_~main__t~0) (= main_~__VERIFIER_assert__cond~0 1)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L421 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-11-07 05:06:36,114 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-11-07 05:06:36,115 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-07 05:06:36,116 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-11-07 05:06:36,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:36 BoogieIcfgContainer [2018-11-07 05:06:36,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:06:36,133 INFO L168 Benchmark]: Toolchain (without parser) took 12638.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 883.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -945.9 MB). Peak memory consumption was 631.0 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:36,134 INFO L168 Benchmark]: CDTParser took 0.26 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 05:06:36,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.00 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 05:06:36,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.55 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 05:06:36,136 INFO L168 Benchmark]: Boogie Preprocessor took 63.22 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 05:06:36,136 INFO L168 Benchmark]: RCFGBuilder took 855.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -756.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:36,137 INFO L168 Benchmark]: TraceAbstraction took 11285.90 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 155.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 648.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:36,142 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 397.00 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 31.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.22 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 855.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -756.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11285.90 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 155.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 648.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: 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: 277]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((1 <= main__t || __VERIFIER_assert__cond == 1) && main__t + 1 <= main__tagbuf_len) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 11.2s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 2467 SDslu, 1673 SDs, 0 SdLazy, 1819 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 614 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 54 HoareAnnotationTreeSize, 9 FomulaSimplifications, 9989709 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16618 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...