java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:06:06,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:06:06,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:06:06,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:06:06,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:06:06,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:06:06,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:06:06,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:06:06,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:06:06,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:06:06,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:06:06,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:06:06,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:06:06,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:06:06,115 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:06:06,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:06:06,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:06:06,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:06:06,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:06:06,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:06:06,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:06:06,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:06:06,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:06:06,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:06:06,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:06:06,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:06:06,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:06:06,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:06:06,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:06:06,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:06:06,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:06:06,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:06:06,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:06:06,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:06:06,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:06:06,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:06:06,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:06:06,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:06:06,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:06:06,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:06:06,164 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:06:06,164 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:06:06,164 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:06:06,165 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:06:06,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:06:06,165 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:06:06,165 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:06:06,166 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:06:06,166 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:06:06,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:06:06,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:06:06,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:06:06,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:06:06,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:06:06,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:06:06,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:06:06,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:06:06,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:06:06,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:06:06,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:06:06,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:06:06,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:06:06,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:06:06,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:06:06,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:06:06,171 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:06:06,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:06:06,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:06:06,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:06:06,171 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:06:06,172 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:06:06,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:06:06,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:06:06,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:06:06,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:06:06,259 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:06:06,260 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.p+lhb-reducer.c [2018-11-07 05:06:06,313 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0c7ecf7/6550623cd63748b1bf7d751e64bf1db1/FLAG871a8fcc5 [2018-11-07 05:06:06,791 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:06:06,795 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-07 05:06:06,807 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0c7ecf7/6550623cd63748b1bf7d751e64bf1db1/FLAG871a8fcc5 [2018-11-07 05:06:06,823 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0c7ecf7/6550623cd63748b1bf7d751e64bf1db1 [2018-11-07 05:06:06,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:06:06,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:06:06,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:06:06,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:06:06,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:06:06,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:06" (1/1) ... [2018-11-07 05:06:06,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89bea10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:06, skipping insertion in model container [2018-11-07 05:06:06,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:06" (1/1) ... [2018-11-07 05:06:06,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:06:06,905 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:06:07,262 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:06:07,274 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:06:07,361 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:06:07,384 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:06:07,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07 WrapperNode [2018-11-07 05:06:07,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:06:07,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:06:07,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:06:07,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:06:07,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:06:07,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:06:07,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:06:07,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:06:07,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... [2018-11-07 05:06:07,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:06:07,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:06:07,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:06:07,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:06:07,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:06:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:06:07,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:06:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:06:07,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:06:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:06:07,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:06:08,750 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:06:08,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:08 BoogieIcfgContainer [2018-11-07 05:06:08,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:06:08,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:06:08,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:06:08,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:06:08,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:06:06" (1/3) ... [2018-11-07 05:06:08,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea9d60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:08, skipping insertion in model container [2018-11-07 05:06:08,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:07" (2/3) ... [2018-11-07 05:06:08,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea9d60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:08, skipping insertion in model container [2018-11-07 05:06:08,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:08" (3/3) ... [2018-11-07 05:06:08,760 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-07 05:06:08,770 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:06:08,779 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-07 05:06:08,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-07 05:06:08,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:06:08,835 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:06:08,835 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:06:08,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:06:08,835 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:06:08,835 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:06:08,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:06:08,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:06:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-07 05:06:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:06:08,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:08,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:08,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:08,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-07 05:06:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:08,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:08,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:09,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:09,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 05:06:09,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:09,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:06:09,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:06:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 05:06:09,248 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-07 05:06:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:10,124 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2018-11-07 05:06:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:06:10,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-07 05:06:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:10,140 INFO L225 Difference]: With dead ends: 135 [2018-11-07 05:06:10,141 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 05:06:10,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:06:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 05:06:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-07 05:06:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 05:06:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-07 05:06:10,195 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2018-11-07 05:06:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:10,195 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-07 05:06:10,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:06:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-07 05:06:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 05:06:10,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:10,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:10,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:10,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-07 05:06:10,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:10,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:10,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:10,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:10,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:10,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:10,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:10,320 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 6 states. [2018-11-07 05:06:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:10,943 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-07 05:06:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:10,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-07 05:06:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:10,947 INFO L225 Difference]: With dead ends: 118 [2018-11-07 05:06:10,948 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 05:06:10,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 05:06:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-07 05:06:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 05:06:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-11-07 05:06:10,961 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2018-11-07 05:06:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:10,961 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-11-07 05:06:10,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-07 05:06:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:06:10,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:10,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:10,964 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:10,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-07 05:06:10,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:10,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:10,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:11,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:11,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:11,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:11,082 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2018-11-07 05:06:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:11,536 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-07 05:06:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:11,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 05:06:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:11,540 INFO L225 Difference]: With dead ends: 148 [2018-11-07 05:06:11,540 INFO L226 Difference]: Without dead ends: 146 [2018-11-07 05:06:11,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-07 05:06:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2018-11-07 05:06:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 05:06:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-11-07 05:06:11,552 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-11-07 05:06:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:11,553 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-11-07 05:06:11,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-07 05:06:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:06:11,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:11,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:11,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:11,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-07 05:06:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:11,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:11,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:11,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:11,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:11,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:11,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:11,636 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2018-11-07 05:06:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:12,174 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-11-07 05:06:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:12,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 05:06:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:12,178 INFO L225 Difference]: With dead ends: 144 [2018-11-07 05:06:12,178 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 05:06:12,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 05:06:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2018-11-07 05:06:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 05:06:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-11-07 05:06:12,189 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2018-11-07 05:06:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:12,190 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-11-07 05:06:12,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-07 05:06:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:12,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:12,191 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:12,192 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:12,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-07 05:06:12,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:12,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:12,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:12,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:12,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:12,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:12,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:12,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:12,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:12,320 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2018-11-07 05:06:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:12,780 INFO L93 Difference]: Finished difference Result 172 states and 191 transitions. [2018-11-07 05:06:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:12,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:06:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:12,783 INFO L225 Difference]: With dead ends: 172 [2018-11-07 05:06:12,783 INFO L226 Difference]: Without dead ends: 170 [2018-11-07 05:06:12,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-07 05:06:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2018-11-07 05:06:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 05:06:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-11-07 05:06:12,793 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2018-11-07 05:06:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:12,794 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-07 05:06:12,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-11-07 05:06:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:06:12,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:12,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:12,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:12,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-07 05:06:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:12,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:12,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:12,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:12,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:12,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:12,999 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-11-07 05:06:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:13,398 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-07 05:06:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:13,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:06:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:13,400 INFO L225 Difference]: With dead ends: 132 [2018-11-07 05:06:13,400 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 05:06:13,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 05:06:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2018-11-07 05:06:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-07 05:06:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-11-07 05:06:13,410 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2018-11-07 05:06:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:13,411 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-11-07 05:06:13,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-11-07 05:06:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:13,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:13,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:13,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:13,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-07 05:06:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:13,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:13,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:13,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 05:06:13,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:13,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:06:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:06:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:13,586 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 8 states. [2018-11-07 05:06:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:14,107 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-07 05:06:14,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:14,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 05:06:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:14,110 INFO L225 Difference]: With dead ends: 120 [2018-11-07 05:06:14,110 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 05:06:14,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:06:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 05:06:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-07 05:06:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 05:06:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-11-07 05:06:14,119 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2018-11-07 05:06:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:14,119 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-11-07 05:06:14,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:06:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-07 05:06:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:14,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:14,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:14,121 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:14,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-07 05:06:14,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:14,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:14,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:14,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:14,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:14,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:14,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:14,190 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2018-11-07 05:06:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:15,170 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2018-11-07 05:06:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:15,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 05:06:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:15,173 INFO L225 Difference]: With dead ends: 162 [2018-11-07 05:06:15,173 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 05:06:15,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 05:06:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2018-11-07 05:06:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 05:06:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-07 05:06:15,181 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2018-11-07 05:06:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:15,181 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-07 05:06:15,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-07 05:06:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:06:15,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:15,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:15,183 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:15,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-07 05:06:15,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:15,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:15,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:15,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:15,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:15,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 05:06:15,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:15,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:06:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:06:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:15,320 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2018-11-07 05:06:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:15,770 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-07 05:06:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:15,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 05:06:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:15,772 INFO L225 Difference]: With dead ends: 99 [2018-11-07 05:06:15,772 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 05:06:15,773 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 05:06:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 05:06:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-07 05:06:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 05:06:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-07 05:06:15,779 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2018-11-07 05:06:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:15,779 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-07 05:06:15,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:06:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-07 05:06:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:06:15,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:15,781 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:15,781 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:15,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-07 05:06:15,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:15,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:15,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:15,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:15,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:15,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 05:06:15,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:15,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:06:15,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:06:15,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:15,947 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2018-11-07 05:06:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:16,397 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-07 05:06:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:16,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-07 05:06:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:16,399 INFO L225 Difference]: With dead ends: 111 [2018-11-07 05:06:16,399 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 05:06:16,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:06:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 05:06:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2018-11-07 05:06:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 05:06:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-07 05:06:16,407 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2018-11-07 05:06:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:16,407 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-07 05:06:16,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:06:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-07 05:06:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:06:16,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:16,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:16,409 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:16,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-07 05:06:16,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:16,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:16,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:16,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:16,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 05:06:16,489 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:16,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:06:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:06:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 05:06:16,491 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-11-07 05:06:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:16,806 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-07 05:06:16,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:16,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 05:06:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:16,808 INFO L225 Difference]: With dead ends: 108 [2018-11-07 05:06:16,808 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 05:06:16,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 05:06:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-07 05:06:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 05:06:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-11-07 05:06:16,814 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2018-11-07 05:06:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:16,814 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-11-07 05:06:16,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:06:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-11-07 05:06:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:06:16,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:16,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:16,816 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:16,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-07 05:06:16,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:16,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:16,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:16,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:06:16,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:16,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:06:16,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:06:16,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:06:16,978 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2018-11-07 05:06:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:17,625 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-07 05:06:17,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:17,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 05:06:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:17,626 INFO L225 Difference]: With dead ends: 104 [2018-11-07 05:06:17,626 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:06:17,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:06:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:06:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-07 05:06:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 05:06:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-07 05:06:17,630 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2018-11-07 05:06:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:17,631 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-07 05:06:17,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:06:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-07 05:06:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 05:06:17,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:17,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:17,633 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:17,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2018-11-07 05:06:17,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:17,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:17,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:17,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:17,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:17,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 05:06:17,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:17,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:06:17,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:06:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 05:06:17,926 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 7 states. [2018-11-07 05:06:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:18,109 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-07 05:06:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:18,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-07 05:06:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:18,111 INFO L225 Difference]: With dead ends: 67 [2018-11-07 05:06:18,111 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 05:06:18,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:06:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 05:06:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-07 05:06:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 05:06:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-07 05:06:18,117 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2018-11-07 05:06:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-07 05:06:18,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:06:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-07 05:06:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 05:06:18,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:18,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:18,125 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:18,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2018-11-07 05:06:18,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:18,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:18,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 05:06:18,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:18,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:06:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:06:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 05:06:18,365 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 7 states. [2018-11-07 05:06:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:18,525 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-07 05:06:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:06:18,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-07 05:06:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:18,527 INFO L225 Difference]: With dead ends: 56 [2018-11-07 05:06:18,528 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:06:18,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:06:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:06:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 05:06:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:06:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 05:06:18,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2018-11-07 05:06:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:18,532 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 05:06:18,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:06:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 05:06:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 05:06:18,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:18,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:18,534 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:18,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2018-11-07 05:06:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:18,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:18,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 05:06:18,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:18,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:06:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:06:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:18,740 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-11-07 05:06:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:18,960 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-07 05:06:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:06:18,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-07 05:06:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:18,962 INFO L225 Difference]: With dead ends: 62 [2018-11-07 05:06:18,962 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 05:06:18,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 05:06:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-07 05:06:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 05:06:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-07 05:06:18,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-07 05:06:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:18,967 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-07 05:06:18,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:06:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-07 05:06:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 05:06:18,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:18,968 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:18,969 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:18,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:18,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2018-11-07 05:06:18,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:18,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:18,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:19,564 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-07 05:06:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:06:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 05:06:19,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:19,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:06:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:06:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:06:19,688 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-11-07 05:06:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:19,896 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-07 05:06:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:06:19,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-07 05:06:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:19,897 INFO L225 Difference]: With dead ends: 52 [2018-11-07 05:06:19,897 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:06:19,899 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:06:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:06:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:06:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:06:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:06:19,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-07 05:06:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:19,900 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:06:19,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:06:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:06:19,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:06:19,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:06:20,057 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:20,057 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:20,057 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:20,057 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:20,058 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:06:20,058 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:20,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:20,058 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2018-11-07 05:06:20,058 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2018-11-07 05:06:20,059 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2018-11-07 05:06:20,060 INFO L421 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-07 05:06:20,060 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2018-11-07 05:06:20,061 INFO L425 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L421 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2018-11-07 05:06:20,062 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L428 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2018-11-07 05:06:20,063 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 05:06:20,064 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2018-11-07 05:06:20,065 INFO L421 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~14 1) (<= 1 main_~main__t~0)) [2018-11-07 05:06:20,065 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2018-11-07 05:06:20,065 INFO L425 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2018-11-07 05:06:20,065 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2018-11-07 05:06:20,065 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2018-11-07 05:06:20,065 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2018-11-07 05:06:20,066 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2018-11-07 05:06:20,067 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2018-11-07 05:06:20,068 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2018-11-07 05:06:20,068 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-11-07 05:06:20,068 INFO L421 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2018-11-07 05:06:20,068 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-11-07 05:06:20,068 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 05:06:20,068 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2018-11-07 05:06:20,069 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2018-11-07 05:06:20,070 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-07 05:06:20,071 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2018-11-07 05:06:20,072 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2018-11-07 05:06:20,073 INFO L425 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2018-11-07 05:06:20,074 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2018-11-07 05:06:20,074 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2018-11-07 05:06:20,074 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2018-11-07 05:06:20,074 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2018-11-07 05:06:20,074 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2018-11-07 05:06:20,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:20 BoogieIcfgContainer [2018-11-07 05:06:20,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:06:20,092 INFO L168 Benchmark]: Toolchain (without parser) took 13259.34 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 862.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 9.1 kB). Peak memory consumption was 862.5 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:20,093 INFO L168 Benchmark]: CDTParser took 0.18 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 05:06:20,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.46 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:20,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:20,095 INFO L168 Benchmark]: Boogie Preprocessor took 84.59 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 65.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -125.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:20,096 INFO L168 Benchmark]: RCFGBuilder took 1250.65 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 797.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -735.8 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:20,097 INFO L168 Benchmark]: TraceAbstraction took 11339.30 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.4 GB in the end (delta: 837.9 MB). Peak memory consumption was 837.9 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:20,102 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.18 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 550.46 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.72 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 84.59 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 65.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -125.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1250.65 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 797.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -735.8 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11339.30 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.4 GB in the end (delta: 837.9 MB). Peak memory consumption was 837.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 11.2s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 3153 SDslu, 1131 SDs, 0 SdLazy, 3796 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 284 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 40 HoareAnnotationTreeSize, 9 FomulaSimplifications, 60910 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 21650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...