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-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:13:18,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:13:18,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:13:18,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:13:18,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:13:18,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:13:18,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:13:18,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:13:18,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:13:18,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:13:18,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:13:18,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:13:18,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:13:18,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:13:18,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:13:18,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:13:18,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:13:18,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:13:18,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:13:18,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:13:18,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:13:18,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:13:18,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:13:18,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:13:18,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:13:18,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:13:18,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:13:18,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:13:18,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:13:18,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:13:18,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:13:18,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:13:18,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:13:18,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:13:18,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:13:18,615 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:13:18,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:13:18,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:13:18,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:13:18,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:13:18,634 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:13:18,634 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:13:18,634 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:13:18,634 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:13:18,634 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:13:18,635 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:13:18,635 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:13:18,635 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:13:18,635 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:13:18,635 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:13:18,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:13:18,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:13:18,637 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:13:18,637 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:13:18,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:13:18,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:13:18,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:13:18,638 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:13:18,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:13:18,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:13:18,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:13:18,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:13:18,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:13:18,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:13:18,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:13:18,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:13:18,640 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:13:18,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:13:18,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:13:18,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:13:18,640 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:13:18,641 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:13:18,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:13:18,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:13:18,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:13:18,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:13:18,719 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:13:18,720 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+nlh-reducer.c [2018-11-07 22:13:18,781 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8301d3d6/0f8b6628717648cfa70f97b4e82a864a/FLAG66c03c010 [2018-11-07 22:13:19,213 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:13:19,214 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-07 22:13:19,224 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8301d3d6/0f8b6628717648cfa70f97b4e82a864a/FLAG66c03c010 [2018-11-07 22:13:19,238 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8301d3d6/0f8b6628717648cfa70f97b4e82a864a [2018-11-07 22:13:19,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:13:19,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:13:19,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:19,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:13:19,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:13:19,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6507d5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19, skipping insertion in model container [2018-11-07 22:13:19,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:13:19,305 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:13:19,602 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:19,607 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:13:19,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:13:19,692 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:13:19,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19 WrapperNode [2018-11-07 22:13:19,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:13:19,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:19,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:13:19,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:13:19,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:13:19,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:13:19,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:13:19,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:13:19,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (1/1) ... [2018-11-07 22:13:19,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:13:19,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:13:19,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:13:19,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:13:19,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (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 22:13:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:13:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:13:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:13:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:13:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:13:19,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:13:20,678 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:13:20,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:20 BoogieIcfgContainer [2018-11-07 22:13:20,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:13:20,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:13:20,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:13:20,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:13:20,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:19" (1/3) ... [2018-11-07 22:13:20,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd90b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:20, skipping insertion in model container [2018-11-07 22:13:20,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:19" (2/3) ... [2018-11-07 22:13:20,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd90b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:20, skipping insertion in model container [2018-11-07 22:13:20,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:20" (3/3) ... [2018-11-07 22:13:20,691 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-07 22:13:20,702 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:13:20,711 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-07 22:13:20,730 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-07 22:13:20,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:13:20,771 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:13:20,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:13:20,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:13:20,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:13:20,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:13:20,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:13:20,772 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:13:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-07 22:13:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 22:13:20,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:20,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:20,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:20,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-07 22:13:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:21,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:21,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:13:21,173 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:21,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:13:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:13:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:13:21,194 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-07 22:13:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:21,804 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-07 22:13:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:13:21,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-07 22:13:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:21,818 INFO L225 Difference]: With dead ends: 129 [2018-11-07 22:13:21,819 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 22:13:21,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:13:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 22:13:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-07 22:13:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 22:13:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-07 22:13:21,865 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-07 22:13:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:21,866 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-07 22:13:21,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:13:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-07 22:13:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 22:13:21,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:21,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:21,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:21,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-07 22:13:21,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:21,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:21,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:21,921 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 22:13:21,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:21,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 22:13:21,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:21,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:13:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:13:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 22:13:21,926 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-07 22:13:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:22,096 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-07 22:13:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:13:22,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-07 22:13:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:22,100 INFO L225 Difference]: With dead ends: 69 [2018-11-07 22:13:22,100 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 22:13:22,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:13:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 22:13:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-07 22:13:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 22:13:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-07 22:13:22,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-07 22:13:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:22,111 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-07 22:13:22,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:13:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-07 22:13:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 22:13:22,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:22,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:22,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:22,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-07 22:13:22,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:22,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:22,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:22,201 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 22:13:22,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:13:22,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:22,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:13:22,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:13:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:13:22,203 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-07 22:13:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:22,678 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-07 22:13:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:13:22,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-07 22:13:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:22,682 INFO L225 Difference]: With dead ends: 73 [2018-11-07 22:13:22,682 INFO L226 Difference]: Without dead ends: 71 [2018-11-07 22:13:22,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:13:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-07 22:13:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-07 22:13:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 22:13:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-07 22:13:22,692 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-07 22:13:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:22,692 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-07 22:13:22,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:13:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-07 22:13:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:13:22,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:22,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:22,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:22,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:22,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-07 22:13:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:22,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:22,882 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 22:13:22,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:22,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:22,883 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:22,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:22,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:22,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:22,884 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-07 22:13:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:23,144 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-07 22:13:23,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:23,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 22:13:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:23,147 INFO L225 Difference]: With dead ends: 107 [2018-11-07 22:13:23,147 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:13:23,147 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 22:13:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:13:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-07 22:13:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 22:13:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-07 22:13:23,157 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-07 22:13:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:23,158 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-07 22:13:23,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-07 22:13:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:13:23,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:23,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:23,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:23,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-07 22:13:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:23,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:23,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,228 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 22:13:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:23,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:23,229 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:23,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:23,230 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-07 22:13:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:23,426 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-07 22:13:23,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:23,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 22:13:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:23,431 INFO L225 Difference]: With dead ends: 69 [2018-11-07 22:13:23,431 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 22:13:23,432 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 22:13:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 22:13:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 22:13:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 22:13:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-07 22:13:23,440 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-07 22:13:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-07 22:13:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-07 22:13:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:13:23,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:23,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:23,442 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:23,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-07 22:13:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:23,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,636 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 22:13:23,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:23,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:23,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:23,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:23,638 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-07 22:13:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:23,878 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-07 22:13:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:23,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 22:13:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:23,882 INFO L225 Difference]: With dead ends: 146 [2018-11-07 22:13:23,882 INFO L226 Difference]: Without dead ends: 144 [2018-11-07 22:13:23,883 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 22:13:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-07 22:13:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-07 22:13:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 22:13:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-07 22:13:23,893 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-07 22:13:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:23,894 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-07 22:13:23,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-07 22:13:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:13:23,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:23,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:23,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:23,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-07 22:13:23,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:23,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:23,983 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 22:13:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:23,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:23,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:23,986 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-07 22:13:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:24,211 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-07 22:13:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:24,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 22:13:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:24,214 INFO L225 Difference]: With dead ends: 99 [2018-11-07 22:13:24,214 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 22:13:24,215 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 22:13:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 22:13:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-07 22:13:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 22:13:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 22:13:24,223 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-07 22:13:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:24,223 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 22:13:24,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 22:13:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:13:24,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:24,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:24,225 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:24,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-07 22:13:24,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:24,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:24,299 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 22:13:24,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:24,299 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:24,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:24,300 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-07 22:13:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:24,634 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-07 22:13:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:24,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 22:13:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:24,636 INFO L225 Difference]: With dead ends: 61 [2018-11-07 22:13:24,636 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 22:13:24,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 22:13:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-07 22:13:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 22:13:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 22:13:24,644 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-07 22:13:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:24,644 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 22:13:24,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 22:13:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:13:24,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:24,645 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 22:13:24,646 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:24,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-07 22:13:24,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:24,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:24,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:24,787 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 22:13:24,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 22:13:24,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:24,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:13:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:13:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:24,789 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-07 22:13:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:25,047 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-07 22:13:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:25,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 22:13:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:25,049 INFO L225 Difference]: With dead ends: 95 [2018-11-07 22:13:25,050 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 22:13:25,050 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 22:13:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 22:13:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-07 22:13:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:13:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 22:13:25,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-07 22:13:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:25,056 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 22:13:25,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:13:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 22:13:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:13:25,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:25,057 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 22:13:25,058 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:25,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-07 22:13:25,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:25,142 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 22:13:25,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:25,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:25,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:25,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:25,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:25,144 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-07 22:13:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:25,298 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-07 22:13:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:25,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 22:13:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:25,299 INFO L225 Difference]: With dead ends: 72 [2018-11-07 22:13:25,299 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 22:13:25,300 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 22:13:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 22:13:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-07 22:13:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 22:13:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 22:13:25,310 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-07 22:13:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:25,311 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 22:13:25,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 22:13:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:13:25,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:25,313 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 22:13:25,314 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:25,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-07 22:13:25,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:25,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:25,389 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 22:13:25,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:25,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:25,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:25,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:25,391 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-07 22:13:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:25,498 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-07 22:13:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:25,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 22:13:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:25,500 INFO L225 Difference]: With dead ends: 53 [2018-11-07 22:13:25,500 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 22:13:25,501 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 22:13:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 22:13:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-07 22:13:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:13:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 22:13:25,508 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-07 22:13:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:25,508 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 22:13:25,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 22:13:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:13:25,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:25,510 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 22:13:25,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-07 22:13:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:25,633 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 22:13:25,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:25,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 22:13:25,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:13:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:13:25,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:13:25,636 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-07 22:13:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:25,873 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-07 22:13:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:25,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-07 22:13:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:25,874 INFO L225 Difference]: With dead ends: 51 [2018-11-07 22:13:25,874 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 22:13:25,875 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 22:13:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 22:13:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-07 22:13:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 22:13:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 22:13:25,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-07 22:13:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:25,881 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 22:13:25,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:13:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 22:13:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:13:25,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:25,882 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 22:13:25,883 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:25,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-07 22:13:25,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:25,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:26,065 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 22:13:26,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:26,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:26,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:26,068 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-07 22:13:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:26,471 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-07 22:13:26,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:26,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 22:13:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:26,472 INFO L225 Difference]: With dead ends: 69 [2018-11-07 22:13:26,472 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 22:13:26,473 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 22:13:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 22:13:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-07 22:13:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 22:13:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 22:13:26,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-07 22:13:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:26,479 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 22:13:26,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 22:13:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:13:26,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:26,480 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 22:13:26,481 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:26,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-07 22:13:26,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:26,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:26,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:26,821 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-07 22:13:27,110 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-07 22:13:27,352 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-07 22:13:27,625 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 22:13:27,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:27,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 22:13:27,626 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:27,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:13:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:13:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:13:27,628 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-07 22:13:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:27,870 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-07 22:13:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:27,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 22:13:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:27,872 INFO L225 Difference]: With dead ends: 57 [2018-11-07 22:13:27,872 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 22:13:27,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:13:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 22:13:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-07 22:13:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 22:13:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-07 22:13:27,880 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-07 22:13:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:27,880 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-07 22:13:27,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:13:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-07 22:13:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:13:27,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:27,881 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 22:13:27,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:27,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-07 22:13:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:27,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:28,020 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 22:13:28,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:28,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 22:13:28,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:28,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:13:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:13:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:13:28,021 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-07 22:13:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:28,333 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-07 22:13:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:13:28,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 22:13:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:28,335 INFO L225 Difference]: With dead ends: 41 [2018-11-07 22:13:28,335 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 22:13:28,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:13:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 22:13:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 22:13:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 22:13:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-07 22:13:28,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-07 22:13:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:28,344 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-07 22:13:28,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:13:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-07 22:13:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:13:28,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:28,345 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 22:13:28,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:28,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-07 22:13:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:28,504 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 22:13:28,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:28,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 22:13:28,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:28,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:13:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:13:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:13:28,505 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-07 22:13:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:28,952 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-07 22:13:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:28,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-07 22:13:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:28,954 INFO L225 Difference]: With dead ends: 52 [2018-11-07 22:13:28,954 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 22:13:28,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:13:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 22:13:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-07 22:13:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:13:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-07 22:13:28,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-07 22:13:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:28,959 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-07 22:13:28,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:13:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-07 22:13:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:13:28,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:28,960 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 22:13:28,961 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:28,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-07 22:13:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:28,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:29,161 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 22:13:29,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:29,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 22:13:29,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:29,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:13:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:13:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:13:29,162 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-07 22:13:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:29,527 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-07 22:13:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:29,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 22:13:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:29,529 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:13:29,529 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 22:13:29,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 22:13:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-07 22:13:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 22:13:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-07 22:13:29,535 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-07 22:13:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:29,535 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-07 22:13:29,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:13:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-07 22:13:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:13:29,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:29,536 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 22:13:29,537 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:29,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-07 22:13:29,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:29,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:29,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:29,627 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 22:13:29,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:13:29,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:13:29,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:13:29,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:13:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:13:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:13:29,629 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-07 22:13:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:29,735 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-07 22:13:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:13:29,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 22:13:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:29,736 INFO L225 Difference]: With dead ends: 37 [2018-11-07 22:13:29,736 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:13:29,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:13:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:13:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:13:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:13:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:13:29,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-07 22:13:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:29,738 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:13:29,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:13:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:13:29,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:13:29,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:13:29,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:13:29,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:13:29,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:13:30,280 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-07 22:13:30,713 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-07 22:13:31,150 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2018-11-07 22:13:31,181 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:13:31,181 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:13:31,181 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:13:31,182 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:13:31,182 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:13:31,182 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:13:31,182 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:13:31,182 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-07 22:13:31,182 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-07 22:13:31,182 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-07 22:13:31,183 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-07 22:13:31,184 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-07 22:13:31,185 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-07 22:13:31,185 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-07 22:13:31,185 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-07 22:13:31,185 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-07 22:13:31,185 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-07 22:13:31,185 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-07 22:13:31,186 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-07 22:13:31,186 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-07 22:13:31,186 INFO L421 ceAbstractionStarter]: At program point L352(lines 278 359) 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 22:13:31,186 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-07 22:13:31,186 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-07 22:13:31,186 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-07 22:13:31,187 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-07 22:13:31,187 INFO L421 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= 1 main_~__VERIFIER_assert__cond~0) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-07 22:13:31,187 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-07 22:13:31,187 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-07 22:13:31,187 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-07 22:13:31,188 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-07 22:13:31,189 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-07 22:13:31,190 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-07 22:13:31,191 INFO L421 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-07 22:13:31,192 INFO L421 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-07 22:13:31,192 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-07 22:13:31,192 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 22:13:31,192 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-07 22:13:31,192 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-07 22:13:31,193 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-07 22:13:31,193 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-07 22:13:31,193 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-07 22:13:31,193 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-07 22:13:31,193 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-07 22:13:31,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:13:31 BoogieIcfgContainer [2018-11-07 22:13:31,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:13:31,212 INFO L168 Benchmark]: Toolchain (without parser) took 11962.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -205.6 MB). Peak memory consumption was 538.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:31,213 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:13:31,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.93 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 22:13:31,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.48 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 22:13:31,215 INFO L168 Benchmark]: Boogie Preprocessor took 39.47 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 22:13:31,216 INFO L168 Benchmark]: RCFGBuilder took 918.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:31,217 INFO L168 Benchmark]: TraceAbstraction took 10531.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 548.5 MB). Peak memory consumption was 548.5 MB. Max. memory is 7.1 GB. [2018-11-07 22:13:31,221 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.93 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 26.48 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 39.47 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 918.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10531.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 548.5 MB). Peak memory consumption was 548.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 10.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 1999 SDslu, 1410 SDs, 0 SdLazy, 1547 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 64 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 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...