java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:15,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:15,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:15,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:15,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:15,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:15,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:15,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:15,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:15,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:15,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:15,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:15,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:15,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:15,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:15,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:15,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:15,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:15,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:15,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:15,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:15,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:15,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:15,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:15,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:15,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:15,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:15,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:15,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:15,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:15,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:15,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:15,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:15,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:15,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:15,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:15,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:15,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:15,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:15,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:15,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:15,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:49:15,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:15,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:15,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:15,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:15,839 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:15,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:15,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:15,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:15,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:15,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:15,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:15,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:15,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:15,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:15,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:15,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:15,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:15,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:15,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:15,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:15,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:15,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:15,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:15,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:15,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:15,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:15,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:15,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:15,887 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:15,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-03 19:49:15,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fbab9e5/59920aa4aef84a42b3ddf19b79fa86d2/FLAGeab4e76d9 [2019-09-03 19:49:16,356 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:16,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-09-03 19:49:16,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fbab9e5/59920aa4aef84a42b3ddf19b79fa86d2/FLAGeab4e76d9 [2019-09-03 19:49:16,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fbab9e5/59920aa4aef84a42b3ddf19b79fa86d2 [2019-09-03 19:49:16,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:16,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:16,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:16,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:16,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:16,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:16" (1/1) ... [2019-09-03 19:49:16,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e08cfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:16, skipping insertion in model container [2019-09-03 19:49:16,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:16" (1/1) ... [2019-09-03 19:49:16,786 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:16,809 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:17,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:17,028 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:17,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:17,064 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:17,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17 WrapperNode [2019-09-03 19:49:17,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:17,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:17,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:17,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:17,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (1/1) ... [2019-09-03 19:49:17,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:17,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:17,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:17,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:17,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (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 [2019-09-03 19:49:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:49:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:17,487 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:17,487 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:49:17,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:17 BoogieIcfgContainer [2019-09-03 19:49:17,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:17,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:17,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:17,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:17,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:16" (1/3) ... [2019-09-03 19:49:17,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a24dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:17, skipping insertion in model container [2019-09-03 19:49:17,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:17" (2/3) ... [2019-09-03 19:49:17,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a24dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:17, skipping insertion in model container [2019-09-03 19:49:17,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:17" (3/3) ... [2019-09-03 19:49:17,501 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-09-03 19:49:17,519 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:17,530 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:49:17,567 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:49:17,618 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:17,619 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:17,619 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:17,619 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:17,620 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:17,620 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:17,620 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:17,620 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:17,620 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-03 19:49:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:49:17,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:17,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:17,645 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-09-03 19:49:17,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:17,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:17,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:17,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:17,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:17,863 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-09-03 19:49:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:18,092 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2019-09-03 19:49:18,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:18,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 19:49:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:18,112 INFO L225 Difference]: With dead ends: 84 [2019-09-03 19:49:18,112 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:49:18,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:49:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-03 19:49:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:49:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-09-03 19:49:18,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-09-03 19:49:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:18,189 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-09-03 19:49:18,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-09-03 19:49:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:49:18,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:18,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:18,192 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-09-03 19:49:18,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:18,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:18,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:18,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:18,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:18,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:18,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:18,251 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-09-03 19:49:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:18,360 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-09-03 19:49:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:18,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 19:49:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:18,364 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:49:18,364 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:49:18,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:49:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-03 19:49:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:49:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-09-03 19:49:18,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-09-03 19:49:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:18,380 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-09-03 19:49:18,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-09-03 19:49:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:18,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:18,382 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:18,382 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-09-03 19:49:18,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:18,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:18,472 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-09-03 19:49:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:18,595 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-09-03 19:49:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:18,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:18,600 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:49:18,600 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:49:18,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:49:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 19:49:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:49:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-09-03 19:49:18,629 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-09-03 19:49:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:18,630 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-09-03 19:49:18,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-09-03 19:49:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:49:18,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:18,638 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:18,638 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-09-03 19:49:18,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:18,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:49:18,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:18,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:49:18,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:49:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:49:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:18,735 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-09-03 19:49:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:18,899 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-09-03 19:49:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:49:18,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-03 19:49:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:18,902 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:49:18,902 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:49:18,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:49:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:49:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 19:49:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:49:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-03 19:49:18,914 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-09-03 19:49:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:18,914 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-03 19:49:18,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:49:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-03 19:49:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:49:18,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:18,916 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:18,916 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-09-03 19:49:18,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:18,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:49:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:18,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:18,963 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-09-03 19:49:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:19,058 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-09-03 19:49:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:19,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 19:49:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:19,061 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:49:19,062 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:49:19,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:49:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-03 19:49:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 19:49:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-09-03 19:49:19,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-09-03 19:49:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:19,084 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-09-03 19:49:19,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-09-03 19:49:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:49:19,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:19,088 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:19,088 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-09-03 19:49:19,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:49:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:49:19,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:49:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:49:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:19,201 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-09-03 19:49:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:19,346 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-09-03 19:49:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:49:19,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-03 19:49:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:19,348 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:49:19,348 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:49:19,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:49:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-09-03 19:49:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:49:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-09-03 19:49:19,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-09-03 19:49:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:19,359 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-09-03 19:49:19,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:49:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-09-03 19:49:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:49:19,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:19,361 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:19,361 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-09-03 19:49:19,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:49:19,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:19,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:49:19,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:49:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:49:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:19,428 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-09-03 19:49:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:19,595 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-09-03 19:49:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:49:19,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-03 19:49:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:19,598 INFO L225 Difference]: With dead ends: 74 [2019-09-03 19:49:19,598 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:49:19,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:49:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:49:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-03 19:49:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:49:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-09-03 19:49:19,617 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-09-03 19:49:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:19,621 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-09-03 19:49:19,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:49:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-09-03 19:49:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 19:49:19,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:19,626 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:19,626 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-09-03 19:49:19,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:49:19,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 19:49:19,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:49:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:49:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:49:19,709 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-09-03 19:49:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:19,895 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-09-03 19:49:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:49:19,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-03 19:49:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:19,896 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:49:19,896 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:19,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:49:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:19,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-09-03 19:49:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:19,899 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:19,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:49:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:19,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:19,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:20,264 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:49:20,264 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:20,264 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:20,264 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:49:20,264 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:20,264 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,265 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,265 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,266 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,266 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-03 19:49:20,266 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,266 INFO L443 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-09-03 19:49:20,266 INFO L439 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,266 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,267 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-09-03 19:49:20,267 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-03 19:49:20,267 INFO L439 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,267 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-03 19:49:20,267 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-03 19:49:20,267 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2019-09-03 19:49:20,267 INFO L439 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,268 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,268 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,268 INFO L439 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,268 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2019-09-03 19:49:20,268 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,269 INFO L439 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,269 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-09-03 19:49:20,269 INFO L439 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2019-09-03 19:49:20,269 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-03 19:49:20,269 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-09-03 19:49:20,270 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:49:20,270 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:49:20,270 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:49:20,270 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:49:20,270 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:49:20,270 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:49:20,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:49:20 BoogieIcfgContainer [2019-09-03 19:49:20,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:49:20,288 INFO L168 Benchmark]: Toolchain (without parser) took 3518.61 ms. Allocated memory was 137.9 MB in the beginning and 265.8 MB in the end (delta: 127.9 MB). Free memory was 84.3 MB in the beginning and 190.8 MB in the end (delta: -106.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,289 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 102.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.93 ms. Allocated memory is still 137.9 MB. Free memory was 84.1 MB in the beginning and 74.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,291 INFO L168 Benchmark]: Boogie Preprocessor took 148.87 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 74.3 MB in the beginning and 176.6 MB in the end (delta: -102.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,292 INFO L168 Benchmark]: RCFGBuilder took 274.97 ms. Allocated memory is still 199.2 MB. Free memory was 176.6 MB in the beginning and 161.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,293 INFO L168 Benchmark]: TraceAbstraction took 2794.06 ms. Allocated memory was 199.2 MB in the beginning and 265.8 MB in the end (delta: 66.6 MB). Free memory was 161.0 MB in the beginning and 190.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:20,297 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 102.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.93 ms. Allocated memory is still 137.9 MB. Free memory was 84.1 MB in the beginning and 74.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.87 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 74.3 MB in the beginning and 176.6 MB in the end (delta: -102.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.97 ms. Allocated memory is still 199.2 MB. Free memory was 176.6 MB in the beginning and 161.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2794.06 ms. Allocated memory was 199.2 MB in the beginning and 265.8 MB in the end (delta: 66.6 MB). Free memory was 161.0 MB in the beginning and 190.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 <= j && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize) && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 395 SDtfs, 102 SDslu, 1026 SDs, 0 SdLazy, 528 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 369 HoareAnnotationTreeSize, 55 FomulaSimplifications, 621 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 23798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...