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-673a906-m [2019-10-02 11:17:50,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:17:50,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:17:50,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:17:50,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:17:50,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:17:50,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:17:50,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:17:50,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:17:50,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:17:50,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:17:50,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:17:50,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:17:50,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:17:50,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:17:50,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:17:50,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:17:50,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:17:50,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:17:50,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:17:50,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:17:50,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:17:50,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:17:50,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:17:50,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:17:50,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:17:50,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:17:50,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:17:50,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:17:50,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:17:50,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:17:50,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:17:50,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:17:50,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:17:50,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:17:50,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:17:50,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:17:50,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:17:50,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:17:50,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:17:50,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:17:50,072 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-10-02 11:17:50,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:17:50,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:17:50,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:17:50,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:17:50,089 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:17:50,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:17:50,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:17:50,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:17:50,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:17:50,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:17:50,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:17:50,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:17:50,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:17:50,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:17:50,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:17:50,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:17:50,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:17:50,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:17:50,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:17:50,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:17:50,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:17:50,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:17:50,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:17:50,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:17:50,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:17:50,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:17:50,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:17:50,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:17:50,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:17:50,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:17:50,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:17:50,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:17:50,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:17:50,164 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:17:50,165 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-10-02 11:17:50,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cb3aa8e/4decc7113e43454793a7a07bbb787e27/FLAGa774c7bd5 [2019-10-02 11:17:50,718 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:17:50,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-10-02 11:17:50,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cb3aa8e/4decc7113e43454793a7a07bbb787e27/FLAGa774c7bd5 [2019-10-02 11:17:51,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cb3aa8e/4decc7113e43454793a7a07bbb787e27 [2019-10-02 11:17:51,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:17:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:17:51,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:51,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:17:51,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:17:51,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a0c83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51, skipping insertion in model container [2019-10-02 11:17:51,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:17:51,137 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:17:51,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:51,343 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:17:51,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:51,376 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:17:51,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51 WrapperNode [2019-10-02 11:17:51,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:51,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:17:51,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:17:51,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:17:51,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (1/1) ... [2019-10-02 11:17:51,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:17:51,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:17:51,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:17:51,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:17:51,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (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-10-02 11:17:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:17:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:17:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:17:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:17:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:17:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:17:51,830 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:17:51,830 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:17:51,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:51 BoogieIcfgContainer [2019-10-02 11:17:51,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:17:51,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:17:51,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:17:51,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:17:51,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:17:51" (1/3) ... [2019-10-02 11:17:51,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e91a7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:51, skipping insertion in model container [2019-10-02 11:17:51,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:51" (2/3) ... [2019-10-02 11:17:51,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e91a7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:51, skipping insertion in model container [2019-10-02 11:17:51,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:51" (3/3) ... [2019-10-02 11:17:51,864 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-10-02 11:17:51,875 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:17:51,881 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:17:51,897 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:17:51,927 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:17:51,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:17:51,928 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:17:51,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:17:51,928 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:17:51,928 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:17:51,928 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:17:51,929 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:17:51,929 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:17:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-02 11:17:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:17:51,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:51,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:51,953 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-10-02 11:17:51,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:52,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:52,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:52,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:52,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:52,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:52,177 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-10-02 11:17:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:52,368 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2019-10-02 11:17:52,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:52,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-02 11:17:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:52,381 INFO L225 Difference]: With dead ends: 84 [2019-10-02 11:17:52,381 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 11:17:52,386 INFO L640 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-10-02 11:17:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 11:17:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-10-02 11:17:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:17:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-10-02 11:17:52,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-10-02 11:17:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:52,446 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-10-02 11:17:52,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-10-02 11:17:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:17:52,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:52,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:52,448 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-10-02 11:17:52,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:52,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:52,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:52,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:52,516 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-10-02 11:17:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:52,624 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-02 11:17:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:52,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-02 11:17:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:52,628 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:17:52,628 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 11:17:52,629 INFO L640 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-10-02 11:17:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 11:17:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-10-02 11:17:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 11:17:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-10-02 11:17:52,645 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-10-02 11:17:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:52,646 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-10-02 11:17:52,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-10-02 11:17:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:17:52,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:52,647 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:52,648 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-10-02 11:17:52,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:52,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:52,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:52,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:52,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:52,702 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-10-02 11:17:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:52,815 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-02 11:17:52,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:52,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:17:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:52,819 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:17:52,819 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 11:17:52,820 INFO L640 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-10-02 11:17:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 11:17:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-02 11:17:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:17:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-10-02 11:17:52,834 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-10-02 11:17:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:52,834 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-10-02 11:17:52,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-10-02 11:17:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:17:52,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:52,836 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:52,836 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-10-02 11:17:52,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:52,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:52,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:17:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:52,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:52,917 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-10-02 11:17:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,066 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-02 11:17:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:53,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-02 11:17:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,069 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:17:53,069 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 11:17:53,069 INFO L640 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-10-02 11:17:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 11:17:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-02 11:17:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:17:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-02 11:17:53,081 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-10-02 11:17:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,082 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-02 11:17:53,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-02 11:17:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:17:53,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,083 INFO L411 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-10-02 11:17:53,084 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-10-02 11:17:53,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:17:53,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:53,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:53,152 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-10-02 11:17:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,248 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-10-02 11:17:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:53,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-02 11:17:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,250 INFO L225 Difference]: With dead ends: 65 [2019-10-02 11:17:53,250 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 11:17:53,252 INFO L640 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-10-02 11:17:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 11:17:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-02 11:17:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 11:17:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-10-02 11:17:53,273 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-10-02 11:17:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,274 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-10-02 11:17:53,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-10-02 11:17:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:17:53,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,276 INFO L411 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-10-02 11:17:53,277 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-10-02 11:17:53,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 11:17:53,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:53,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:53,373 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-10-02 11:17:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,508 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-02 11:17:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:53,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-02 11:17:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,510 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:17:53,510 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 11:17:53,511 INFO L640 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-10-02 11:17:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 11:17:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-10-02 11:17:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 11:17:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-10-02 11:17:53,522 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-10-02 11:17:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,522 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-10-02 11:17:53,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-10-02 11:17:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:17:53,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,525 INFO L411 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-10-02 11:17:53,525 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-10-02 11:17:53,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 11:17:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:17:53,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:17:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:17:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:53,654 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-10-02 11:17:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,818 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-10-02 11:17:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:53,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 11:17:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,821 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:17:53,821 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 11:17:53,822 INFO L640 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-10-02 11:17:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 11:17:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-02 11:17:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 11:17:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-10-02 11:17:53,837 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-10-02 11:17:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-10-02 11:17:53,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:17:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-10-02 11:17:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 11:17:53,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,839 INFO L411 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-10-02 11:17:53,840 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-10-02 11:17:53,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 11:17:53,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:17:53,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:17:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:17:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:53,945 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-10-02 11:17:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,128 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-10-02 11:17:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:17:54,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-02 11:17:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,129 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:17:54,129 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:17:54,130 INFO L640 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-10-02 11:17:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:17:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:17:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:17:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:17:54,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-10-02 11:17:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,132 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:17:54,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:17:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:17:54,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:17:54,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:17:54,483 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:17:54,484 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:54,484 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:54,484 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:17:54,484 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:17:54,484 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:17:54,484 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-10-02 11:17:54,484 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2019-10-02 11:17:54,485 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-10-02 11:17:54,485 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-10-02 11:17:54,485 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-10-02 11:17:54,485 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-10-02 11:17:54,485 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-10-02 11:17:54,485 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-10-02 11:17:54,486 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-02 11:17:54,486 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-10-02 11:17:54,486 INFO L443 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-10-02 11:17:54,486 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-10-02 11:17:54,486 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-10-02 11:17:54,486 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-10-02 11:17:54,486 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 11:17:54,487 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-10-02 11:17:54,487 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-02 11:17:54,487 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 11:17:54,487 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2019-10-02 11:17:54,487 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-10-02 11:17:54,487 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-10-02 11:17:54,488 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-10-02 11:17:54,488 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-10-02 11:17:54,488 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2019-10-02 11:17:54,488 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-10-02 11:17:54,489 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-10-02 11:17:54,489 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-10-02 11:17:54,489 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-10-02 11:17:54,489 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-02 11:17:54,489 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-10-02 11:17:54,489 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-02 11:17:54,490 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:17:54,490 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-02 11:17:54,490 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-02 11:17:54,490 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-02 11:17:54,490 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:17:54,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:17:54 BoogieIcfgContainer [2019-10-02 11:17:54,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:17:54,509 INFO L168 Benchmark]: Toolchain (without parser) took 3411.64 ms. Allocated memory was 130.0 MB in the beginning and 272.6 MB in the end (delta: 142.6 MB). Free memory was 85.5 MB in the beginning and 191.6 MB in the end (delta: -106.1 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,510 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 130.0 MB. Free memory was 104.1 MB in the beginning and 103.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.92 ms. Allocated memory is still 130.0 MB. Free memory was 85.3 MB in the beginning and 74.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,512 INFO L168 Benchmark]: Boogie Preprocessor took 119.35 ms. Allocated memory was 130.0 MB in the beginning and 197.1 MB in the end (delta: 67.1 MB). Free memory was 74.9 MB in the beginning and 173.4 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,513 INFO L168 Benchmark]: RCFGBuilder took 335.94 ms. Allocated memory is still 197.1 MB. Free memory was 173.4 MB in the beginning and 157.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,514 INFO L168 Benchmark]: TraceAbstraction took 2665.89 ms. Allocated memory was 197.1 MB in the beginning and 272.6 MB in the end (delta: 75.5 MB). Free memory was 157.2 MB in the beginning and 191.6 MB in the end (delta: -34.4 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:54,518 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.48 ms. Allocated memory is still 130.0 MB. Free memory was 104.1 MB in the beginning and 103.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.92 ms. Allocated memory is still 130.0 MB. Free memory was 85.3 MB in the beginning and 74.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.35 ms. Allocated memory was 130.0 MB in the beginning and 197.1 MB in the end (delta: 67.1 MB). Free memory was 74.9 MB in the beginning and 173.4 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.94 ms. Allocated memory is still 197.1 MB. Free memory was 173.4 MB in the beginning and 157.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2665.89 ms. Allocated memory was 197.1 MB in the beginning and 272.6 MB in the end (delta: 75.5 MB). Free memory was 157.2 MB in the beginning and 191.6 MB in the end (delta: -34.4 MB). Peak memory consumption was 41.1 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.5s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 1.1s 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.6s 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.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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...