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-13a467a-m [2019-10-14 23:15:07,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:07,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:07,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:07,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:07,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:07,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:07,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:07,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:07,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:07,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:07,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:07,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:07,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:07,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:07,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:07,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:07,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:07,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:07,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:07,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:07,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:07,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:07,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:07,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:07,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:07,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:07,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:07,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:07,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:07,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:07,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:07,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:07,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:07,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:07,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:07,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:07,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:07,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:07,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:07,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:07,317 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-14 23:15:07,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:07,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:07,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:07,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:07,338 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:07,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:07,338 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:07,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:07,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:07,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:07,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:07,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:07,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:07,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:07,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:07,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:07,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:07,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:07,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:07,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:07,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:07,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:07,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:07,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:07,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:07,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:07,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:07,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:07,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:07,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:07,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:07,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:07,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:07,609 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:07,609 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-14 23:15:07,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe2649a/71b014519c354a6da80faf289e94144d/FLAG56706a4fa [2019-10-14 23:15:08,102 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:08,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-10-14 23:15:08,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe2649a/71b014519c354a6da80faf289e94144d/FLAG56706a4fa [2019-10-14 23:15:08,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe2649a/71b014519c354a6da80faf289e94144d [2019-10-14 23:15:08,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:08,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:08,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:08,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:08,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:08,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c9c6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08, skipping insertion in model container [2019-10-14 23:15:08,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,524 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:08,546 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:08,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:08,706 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:08,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:08,743 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:08,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08 WrapperNode [2019-10-14 23:15:08,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:08,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:08,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:08,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:08,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (1/1) ... [2019-10-14 23:15:08,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:08,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:08,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:08,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:08,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (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-14 23:15:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:15:08,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:09,191 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:09,192 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:15:09,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:09 BoogieIcfgContainer [2019-10-14 23:15:09,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:09,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:09,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:09,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:09,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:08" (1/3) ... [2019-10-14 23:15:09,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63628211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:09, skipping insertion in model container [2019-10-14 23:15:09,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:08" (2/3) ... [2019-10-14 23:15:09,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63628211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:09, skipping insertion in model container [2019-10-14 23:15:09,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:09" (3/3) ... [2019-10-14 23:15:09,220 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-10-14 23:15:09,231 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:09,238 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:15:09,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:15:09,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:09,269 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:09,269 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:09,269 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:09,269 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:09,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:09,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:09,270 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-14 23:15:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:15:09,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:09,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:09,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1778619980, now seen corresponding path program 1 times [2019-10-14 23:15:09,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:09,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182755765] [2019-10-14 23:15:09,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:09,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:09,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:09,531 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-14 23:15:09,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182755765] [2019-10-14 23:15:09,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:09,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:09,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330058774] [2019-10-14 23:15:09,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:09,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:09,563 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-10-14 23:15:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:09,800 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2019-10-14 23:15:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:09,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-14 23:15:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:09,818 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:15:09,818 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 23:15:09,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-14 23:15:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 23:15:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-10-14 23:15:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 23:15:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-10-14 23:15:09,888 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2019-10-14 23:15:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:09,889 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-10-14 23:15:09,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-10-14 23:15:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-14 23:15:09,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:09,893 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:09,894 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1756664013, now seen corresponding path program 1 times [2019-10-14 23:15:09,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:09,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684699334] [2019-10-14 23:15:09,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:09,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:09,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:09,989 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-14 23:15:09,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684699334] [2019-10-14 23:15:09,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:09,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:09,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729867802] [2019-10-14 23:15:09,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:09,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:09,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:09,993 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 5 states. [2019-10-14 23:15:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:10,092 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-14 23:15:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:10,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-14 23:15:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:10,095 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:15:10,095 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 23:15:10,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-14 23:15:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 23:15:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-10-14 23:15:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 23:15:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-10-14 23:15:10,114 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2019-10-14 23:15:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:10,116 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-10-14 23:15:10,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2019-10-14 23:15:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:10,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:10,118 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:10,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash -276218857, now seen corresponding path program 1 times [2019-10-14 23:15:10,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:10,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674813352] [2019-10-14 23:15:10,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,203 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-14 23:15:10,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674813352] [2019-10-14 23:15:10,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:10,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:10,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494871502] [2019-10-14 23:15:10,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:10,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:10,208 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand 5 states. [2019-10-14 23:15:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:10,329 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-14 23:15:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:10,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 23:15:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:10,332 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:15:10,333 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 23:15:10,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-14 23:15:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 23:15:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-14 23:15:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:15:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-10-14 23:15:10,351 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2019-10-14 23:15:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:10,351 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-10-14 23:15:10,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-10-14 23:15:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:15:10,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:10,353 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:10,353 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash -12086036, now seen corresponding path program 1 times [2019-10-14 23:15:10,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:10,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686445200] [2019-10-14 23:15:10,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,455 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-14 23:15:10,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686445200] [2019-10-14 23:15:10,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:10,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:10,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089020878] [2019-10-14 23:15:10,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:10,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:10,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:10,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:10,458 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 6 states. [2019-10-14 23:15:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:10,615 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-14 23:15:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:10,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-14 23:15:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:10,617 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:15:10,617 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 23:15:10,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-14 23:15:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 23:15:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-14 23:15:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:15:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-10-14 23:15:10,629 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2019-10-14 23:15:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:10,630 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-10-14 23:15:10,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-10-14 23:15:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:15:10,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:10,631 INFO L380 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-14 23:15:10,632 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1403678473, now seen corresponding path program 1 times [2019-10-14 23:15:10,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:10,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072022829] [2019-10-14 23:15:10,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,713 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-14 23:15:10,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072022829] [2019-10-14 23:15:10,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:10,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:10,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888806657] [2019-10-14 23:15:10,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:10,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:10,717 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2019-10-14 23:15:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:10,811 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-10-14 23:15:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:10,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-14 23:15:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:10,812 INFO L225 Difference]: With dead ends: 65 [2019-10-14 23:15:10,813 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:15:10,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-14 23:15:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:15:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-14 23:15:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 23:15:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-10-14 23:15:10,824 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2019-10-14 23:15:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:10,825 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-10-14 23:15:10,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-10-14 23:15:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:15:10,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:10,827 INFO L380 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-14 23:15:10,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -869865180, now seen corresponding path program 1 times [2019-10-14 23:15:10,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:10,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234366828] [2019-10-14 23:15:10,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:10,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:10,925 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-14 23:15:10,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234366828] [2019-10-14 23:15:10,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:10,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:10,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941679903] [2019-10-14 23:15:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:10,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:10,930 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 6 states. [2019-10-14 23:15:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:11,082 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-14 23:15:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:11,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-14 23:15:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:11,086 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:15:11,086 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:15:11,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-14 23:15:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:15:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-10-14 23:15:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:15:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-10-14 23:15:11,108 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2019-10-14 23:15:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:11,111 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-10-14 23:15:11,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-10-14 23:15:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-14 23:15:11,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:11,114 INFO L380 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-14 23:15:11,118 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -863098428, now seen corresponding path program 1 times [2019-10-14 23:15:11,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:11,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625895264] [2019-10-14 23:15:11,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:11,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:11,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,222 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-14 23:15:11,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625895264] [2019-10-14 23:15:11,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:11,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:11,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239132342] [2019-10-14 23:15:11,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:11,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:11,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:11,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:11,225 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-10-14 23:15:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:11,390 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-10-14 23:15:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:11,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-14 23:15:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:11,393 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:15:11,393 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:15:11,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-14 23:15:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:15:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-14 23:15:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:15:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-10-14 23:15:11,417 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2019-10-14 23:15:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:11,417 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-10-14 23:15:11,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-10-14 23:15:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-14 23:15:11,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:11,421 INFO L380 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-14 23:15:11,422 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1349635161, now seen corresponding path program 1 times [2019-10-14 23:15:11,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:11,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950659420] [2019-10-14 23:15:11,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:11,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:11,615 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-14 23:15:11,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950659420] [2019-10-14 23:15:11,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:11,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:15:11,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522068883] [2019-10-14 23:15:11,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:15:11,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:15:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:11,619 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2019-10-14 23:15:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:11,782 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2019-10-14 23:15:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:11,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-14 23:15:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:11,784 INFO L225 Difference]: With dead ends: 72 [2019-10-14 23:15:11,784 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:11,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 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-14 23:15:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:11,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-10-14 23:15:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:11,787 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:11,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:15:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:11,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:11,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:12,126 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:15:12,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:12,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:12,127 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:12,127 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:12,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:12,127 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-14 23:15:12,127 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2019-10-14 23:15:12,128 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-14 23:15:12,128 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-14 23:15:12,128 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-14 23:15:12,128 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-14 23:15:12,129 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-14 23:15:12,129 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-14 23:15:12,129 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-14 23:15:12,129 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-14 23:15:12,129 INFO L443 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-10-14 23:15:12,130 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-14 23:15:12,130 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-14 23:15:12,130 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-10-14 23:15:12,130 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-14 23:15:12,130 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-14 23:15:12,130 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-14 23:15:12,131 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-14 23:15:12,131 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2019-10-14 23:15:12,131 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-14 23:15:12,131 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-14 23:15:12,131 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-14 23:15:12,131 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-14 23:15:12,132 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2019-10-14 23:15:12,132 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-14 23:15:12,132 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-14 23:15:12,132 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-10-14 23:15:12,132 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-14 23:15:12,133 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-14 23:15:12,133 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-10-14 23:15:12,134 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-14 23:15:12,134 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-14 23:15:12,135 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:12,135 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-14 23:15:12,135 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-14 23:15:12,135 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:12,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:12 BoogieIcfgContainer [2019-10-14 23:15:12,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:12,158 INFO L168 Benchmark]: Toolchain (without parser) took 3647.51 ms. Allocated memory was 140.0 MB in the beginning and 244.3 MB in the end (delta: 104.3 MB). Free memory was 103.5 MB in the beginning and 129.2 MB in the end (delta: -25.7 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,159 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.03 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 93.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,161 INFO L168 Benchmark]: Boogie Preprocessor took 120.77 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 182.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,162 INFO L168 Benchmark]: RCFGBuilder took 335.18 ms. Allocated memory is still 204.5 MB. Free memory was 182.9 MB in the beginning and 167.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,163 INFO L168 Benchmark]: TraceAbstraction took 2951.16 ms. Allocated memory was 204.5 MB in the beginning and 244.3 MB in the end (delta: 39.8 MB). Free memory was 167.2 MB in the beginning and 129.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:12,167 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 140.0 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.03 ms. Allocated memory is still 140.0 MB. Free memory was 103.3 MB in the beginning and 93.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.77 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 182.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.18 ms. Allocated memory is still 204.5 MB. Free memory was 182.9 MB in the beginning and 167.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2951.16 ms. Allocated memory was 204.5 MB in the beginning and 244.3 MB in the end (delta: 39.8 MB). Free memory was 167.2 MB in the beginning and 129.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 77.9 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. Result: SAFE, OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 11, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 395 SDtfs, 102 SDslu, 1026 SDs, 0 SdLazy, 528 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 93 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 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...