java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:50:06,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:50:06,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:50:06,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:50:06,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:50:06,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:50:06,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:50:06,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:50:06,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:50:06,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:50:06,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:50:06,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:50:06,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:50:06,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:50:06,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:50:06,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:50:06,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:50:06,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:50:06,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:50:06,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:50:06,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:50:06,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:50:06,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:50:06,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:50:06,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:50:06,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:50:06,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:50:06,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:50:06,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:50:06,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:50:06,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:50:06,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:50:06,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:50:06,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:50:06,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:50:06,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:50:06,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:50:06,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:50:06,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:50:06,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:50:06,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:50:06,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:50:06,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:50:06,534 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:50:06,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:50:06,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:50:06,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:50:06,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:50:06,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:50:06,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:50:06,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:50:06,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:50:06,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:50:06,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:50:06,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:50:06,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:50:06,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:50:06,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:50:06,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:50:06,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:50:06,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:50:06,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:50:06,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:50:06,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:50:06,539 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:50:06,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:50:06,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:50:06,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:50:06,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:50:06,617 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:50:06,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-06 22:50:06,680 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c614e0e/fd8cb3dc7052409ba8e44d53f340b105/FLAGa7264475e [2018-11-06 22:50:07,137 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:50:07,138 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-06 22:50:07,145 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c614e0e/fd8cb3dc7052409ba8e44d53f340b105/FLAGa7264475e [2018-11-06 22:50:07,159 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c614e0e/fd8cb3dc7052409ba8e44d53f340b105 [2018-11-06 22:50:07,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:50:07,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:50:07,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:07,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:50:07,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:50:07,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38629173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07, skipping insertion in model container [2018-11-06 22:50:07,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:50:07,216 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:50:07,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:07,395 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:50:07,421 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:07,440 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:50:07,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07 WrapperNode [2018-11-06 22:50:07,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:07,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:07,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:50:07,442 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:50:07,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:07,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:50:07,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:50:07,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:50:07,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... [2018-11-06 22:50:07,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:50:07,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:50:07,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:50:07,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:50:07,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:50:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:50:07,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:50:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-06 22:50:07,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-06 22:50:08,024 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:50:08,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:08 BoogieIcfgContainer [2018-11-06 22:50:08,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:50:08,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:50:08,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:50:08,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:50:08,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:07" (1/3) ... [2018-11-06 22:50:08,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5806b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:08, skipping insertion in model container [2018-11-06 22:50:08,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:07" (2/3) ... [2018-11-06 22:50:08,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5806b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:08, skipping insertion in model container [2018-11-06 22:50:08,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:08" (3/3) ... [2018-11-06 22:50:08,038 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-06 22:50:08,048 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:50:08,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:50:08,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:50:08,107 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:50:08,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:50:08,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:50:08,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:50:08,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:50:08,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:50:08,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:50:08,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:50:08,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:50:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-06 22:50:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-06 22:50:08,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:08,137 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:08,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:08,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash -166467600, now seen corresponding path program 1 times [2018-11-06 22:50:08,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:08,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:08,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:50:08,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:50:08,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:50:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:50:08,280 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-06 22:50:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:08,307 INFO L93 Difference]: Finished difference Result 58 states and 89 transitions. [2018-11-06 22:50:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:50:08,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-06 22:50:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:08,320 INFO L225 Difference]: With dead ends: 58 [2018-11-06 22:50:08,320 INFO L226 Difference]: Without dead ends: 27 [2018-11-06 22:50:08,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:50:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-06 22:50:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-06 22:50:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-06 22:50:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-06 22:50:08,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 11 [2018-11-06 22:50:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:08,368 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-06 22:50:08,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:50:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-06 22:50:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:50:08,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:08,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:08,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:08,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 289290558, now seen corresponding path program 1 times [2018-11-06 22:50:08,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:08,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:08,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:08,478 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 5 states. [2018-11-06 22:50:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:08,645 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-06 22:50:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:08,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-06 22:50:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:08,647 INFO L225 Difference]: With dead ends: 33 [2018-11-06 22:50:08,647 INFO L226 Difference]: Without dead ends: 31 [2018-11-06 22:50:08,649 INFO L604 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 [2018-11-06 22:50:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-06 22:50:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-06 22:50:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-06 22:50:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-06 22:50:08,659 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 13 [2018-11-06 22:50:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:08,661 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-06 22:50:08,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-06 22:50:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 22:50:08,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:08,663 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:08,663 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:08,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -921713506, now seen corresponding path program 1 times [2018-11-06 22:50:08,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:08,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:09,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:09,063 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:09,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:09,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:50:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2018-11-06 22:50:09,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 22:50:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 22:50:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:09,557 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 11 states. [2018-11-06 22:50:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:10,373 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-06 22:50:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:10,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-06 22:50:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:10,375 INFO L225 Difference]: With dead ends: 51 [2018-11-06 22:50:10,375 INFO L226 Difference]: Without dead ends: 49 [2018-11-06 22:50:10,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:50:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-06 22:50:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-06 22:50:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-06 22:50:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-06 22:50:10,395 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 18 [2018-11-06 22:50:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:10,395 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-06 22:50:10,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 22:50:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-06 22:50:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 22:50:10,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:10,399 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:10,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:10,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash 589452909, now seen corresponding path program 1 times [2018-11-06 22:50:10,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:10,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:10,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:10,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:10,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:10,552 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:10,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:10,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:50:10,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:50:10,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-11-06 22:50:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 22:50:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 22:50:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:50:10,708 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 10 states. [2018-11-06 22:50:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:11,166 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-06 22:50:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:11,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-06 22:50:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:11,169 INFO L225 Difference]: With dead ends: 58 [2018-11-06 22:50:11,169 INFO L226 Difference]: Without dead ends: 56 [2018-11-06 22:50:11,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:50:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-06 22:50:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-06 22:50:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-06 22:50:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-11-06 22:50:11,181 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 26 [2018-11-06 22:50:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:11,182 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-06 22:50:11,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 22:50:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-06 22:50:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-06 22:50:11,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:11,184 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:11,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:11,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1830243570, now seen corresponding path program 1 times [2018-11-06 22:50:11,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:11,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:11,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:50:11,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:11,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:11,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-06 22:50:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:50:11,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-11-06 22:50:11,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:50:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:50:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:50:11,555 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 13 states. [2018-11-06 22:50:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:12,289 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-06 22:50:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:50:12,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-06 22:50:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:12,292 INFO L225 Difference]: With dead ends: 74 [2018-11-06 22:50:12,292 INFO L226 Difference]: Without dead ends: 67 [2018-11-06 22:50:12,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-06 22:50:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-06 22:50:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-06 22:50:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-06 22:50:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-06 22:50:12,305 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2018-11-06 22:50:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:12,305 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-06 22:50:12,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:50:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-06 22:50:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:50:12,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:12,307 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:12,307 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:12,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 305093967, now seen corresponding path program 1 times [2018-11-06 22:50:12,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:50:12,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:12,452 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:12,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:12,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-06 22:50:12,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:50:12,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-06 22:50:12,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 22:50:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 22:50:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:50:12,612 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 14 states. [2018-11-06 22:50:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:13,115 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-11-06 22:50:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:50:13,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-06 22:50:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:13,117 INFO L225 Difference]: With dead ends: 76 [2018-11-06 22:50:13,117 INFO L226 Difference]: Without dead ends: 74 [2018-11-06 22:50:13,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-06 22:50:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-06 22:50:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-06 22:50:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-06 22:50:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-11-06 22:50:13,130 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 31 [2018-11-06 22:50:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:13,131 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-06 22:50:13,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 22:50:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-06 22:50:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-06 22:50:13,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:13,133 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:13,134 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:13,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -616623839, now seen corresponding path program 1 times [2018-11-06 22:50:13,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:13,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 22:50:13,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:13,323 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:13,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:13,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 22:50:13,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:13,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-06 22:50:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-06 22:50:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-06 22:50:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-06 22:50:13,594 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand 17 states. [2018-11-06 22:50:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:14,676 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2018-11-06 22:50:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:50:14,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-06 22:50:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:14,680 INFO L225 Difference]: With dead ends: 109 [2018-11-06 22:50:14,680 INFO L226 Difference]: Without dead ends: 97 [2018-11-06 22:50:14,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-11-06 22:50:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-06 22:50:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-06 22:50:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-06 22:50:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2018-11-06 22:50:14,700 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 55 [2018-11-06 22:50:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2018-11-06 22:50:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-06 22:50:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2018-11-06 22:50:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-06 22:50:14,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:14,702 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:14,703 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:14,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1787375170, now seen corresponding path program 1 times [2018-11-06 22:50:14,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:14,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:14,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 22:50:14,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:14,885 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:14,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:14,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-06 22:50:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-06 22:50:15,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:50:15,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:50:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-06 22:50:15,142 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 16 states. [2018-11-06 22:50:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:15,751 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-11-06 22:50:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:50:15,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-11-06 22:50:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:15,754 INFO L225 Difference]: With dead ends: 103 [2018-11-06 22:50:15,754 INFO L226 Difference]: Without dead ends: 101 [2018-11-06 22:50:15,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-06 22:50:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-06 22:50:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-06 22:50:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-06 22:50:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-11-06 22:50:15,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 57 [2018-11-06 22:50:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:15,771 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-11-06 22:50:15,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:50:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-11-06 22:50:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-06 22:50:15,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:15,775 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:15,775 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:15,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1816426131, now seen corresponding path program 2 times [2018-11-06 22:50:15,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:15,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:15,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-06 22:50:15,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:15,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:50:16,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:50:16,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:50:16,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-06 22:50:16,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:16,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-11-06 22:50:16,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-06 22:50:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-06 22:50:16,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-06 22:50:16,674 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 20 states. [2018-11-06 22:50:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:17,839 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-11-06 22:50:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:50:17,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-06 22:50:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:17,842 INFO L225 Difference]: With dead ends: 112 [2018-11-06 22:50:17,843 INFO L226 Difference]: Without dead ends: 110 [2018-11-06 22:50:17,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2018-11-06 22:50:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-06 22:50:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-11-06 22:50:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-06 22:50:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2018-11-06 22:50:17,857 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 83 [2018-11-06 22:50:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:17,857 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2018-11-06 22:50:17,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-06 22:50:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2018-11-06 22:50:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-06 22:50:17,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:17,860 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:17,860 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:17,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1135625023, now seen corresponding path program 2 times [2018-11-06 22:50:17,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:17,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:17,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:17,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:50:17,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-11-06 22:50:18,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:18,162 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:50:18,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:50:18,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:50:18,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-06 22:50:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-11-06 22:50:18,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-06 22:50:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-06 22:50:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-06 22:50:18,730 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 20 states. [2018-11-06 22:50:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:19,428 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-11-06 22:50:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 22:50:19,429 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 107 [2018-11-06 22:50:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:19,430 INFO L225 Difference]: With dead ends: 105 [2018-11-06 22:50:19,430 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:50:19,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-06 22:50:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:50:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:50:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:50:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:50:19,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-11-06 22:50:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:19,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:50:19,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-06 22:50:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:50:19,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:50:19,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:50:19,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:19,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:19,766 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2018-11-06 22:50:20,147 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-06 22:50:20,532 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2018-11-06 22:50:20,761 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-06 22:50:20,966 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-06 22:50:21,152 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse2 (<= 1 ULTIMATE.start_main_~in~0)) (.cse4 (<= .cse5 ULTIMATE.start_main_~bufferlen~0)) (.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse3 (<= (+ ULTIMATE.start_main_~buf~0 3) ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~in~0 2) .cse1 .cse2 .cse3 .cse4) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse0 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~in~0 1) (<= 1 ULTIMATE.start_main_~buf~0)) (and .cse0 (<= ULTIMATE.start_main_~in~0 0) (<= 0 ULTIMATE.start_main_~in~0) (= ULTIMATE.start_main_~bufferlen~0 .cse5) (= 0 ULTIMATE.start_main_~buf~0) .cse3)))) [2018-11-06 22:50:21,152 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse2 (<= 1 ULTIMATE.start_main_~in~0)) (.cse4 (<= .cse5 ULTIMATE.start_main_~bufferlen~0)) (.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse3 (<= (+ ULTIMATE.start_main_~buf~0 3) ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~in~0 2) .cse1 .cse2 .cse3 .cse4) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse0 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~in~0 1) (<= 1 ULTIMATE.start_main_~buf~0)) (and .cse0 (<= ULTIMATE.start_main_~in~0 0) (<= 0 ULTIMATE.start_main_~in~0) (= ULTIMATE.start_main_~bufferlen~0 .cse5) (= 0 ULTIMATE.start_main_~buf~0) .cse3)))) [2018-11-06 22:50:21,152 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-06 22:50:21,152 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-11-06 22:50:21,153 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-06 22:50:21,153 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_main_~in~0)) (.cse2 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= 0 ULTIMATE.start_main_~buf~0))) (or (let ((.cse0 (+ ULTIMATE.start_main_~buflim~0 2))) (and (<= ULTIMATE.start_main_~bufferlen~0 .cse0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse1 .cse2 (<= .cse0 ULTIMATE.start_main_~bufferlen~0) .cse3 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)))) (and .cse1 (<= ULTIMATE.start_main_~buf~0 2) .cse2 .cse3 (<= 3 ULTIMATE.start_main_~inlen~0)) (and .cse2 (<= ULTIMATE.start_main_~buf~0 0) .cse3 (<= 0 ULTIMATE.start_main_~in~0)))) [2018-11-06 22:50:21,153 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 22:50:21,153 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse2 (<= 1 ULTIMATE.start_main_~in~0)) (.cse4 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= .cse5 ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~in~0 1) (<= 1 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse0 .cse2 .cse4 .cse3 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~in~0 2) .cse1 .cse2 .cse4 .cse3)))) [2018-11-06 22:50:21,153 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 22:50:21,154 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse5)) (.cse2 (<= 1 ULTIMATE.start_main_~in~0)) (.cse4 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= .cse5 ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~in~0 1) (<= 1 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse0 .cse2 .cse4 .cse3 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~in~0 2) .cse1 .cse2 .cse4 .cse3)))) [2018-11-06 22:50:21,154 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 22:50:21,154 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 22:50:21,154 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 22:50:21,154 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-06 22:50:21,154 INFO L428 ceAbstractionStarter]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2018-11-06 22:50:21,155 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_main_~buflim~0 2))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0)) (.cse1 (<= ULTIMATE.start_main_~bufferlen~0 .cse4)) (.cse2 (<= 1 ULTIMATE.start_main_~in~0)) (.cse5 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= .cse4 ULTIMATE.start_main_~bufferlen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~in~0 1) (<= 1 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) (and .cse0 (= ULTIMATE.start_main_~bufferlen~0 .cse4) (<= ULTIMATE.start_main_~in~0 0) .cse5 (<= ULTIMATE.start_main_~buf~0 0) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) (and (<= 3 ULTIMATE.start_main_~buf~0) .cse1 .cse0 .cse2 .cse5 .cse3 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0))) (and .cse0 (<= 2 ULTIMATE.start_main_~buf~0) (<= ULTIMATE.start_main_~in~0 2) .cse1 .cse2 .cse5 .cse3)))) [2018-11-06 22:50:21,155 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 22:50:21,155 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-06 22:50:21,155 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-06 22:50:21,155 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-06 22:50:21,155 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)))) (or (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (and (<= 3 ULTIMATE.start_main_~inlen~0) .cse0)) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0))) [2018-11-06 22:50:21,155 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)))) (or (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (and (<= 3 ULTIMATE.start_main_~inlen~0) .cse0)) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0))) [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_main_~in~0)) (.cse2 (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= 0 ULTIMATE.start_main_~buf~0))) (or (let ((.cse0 (+ ULTIMATE.start_main_~buflim~0 2))) (and (<= ULTIMATE.start_main_~bufferlen~0 .cse0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse1 .cse2 (<= .cse0 ULTIMATE.start_main_~bufferlen~0) .cse3 (<= (+ ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~in~0 1) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)))) (and .cse1 (<= ULTIMATE.start_main_~buf~0 2) .cse2 .cse3 (<= 3 ULTIMATE.start_main_~inlen~0)) (and .cse2 (<= ULTIMATE.start_main_~buf~0 0) .cse3 (<= 0 ULTIMATE.start_main_~in~0)))) [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-06 22:50:21,156 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-06 22:50:21,157 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-06 22:50:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:50:21 BoogieIcfgContainer [2018-11-06 22:50:21,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:50:21,174 INFO L168 Benchmark]: Toolchain (without parser) took 14004.81 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 886.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -427.0 MB). Peak memory consumption was 459.0 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:21,175 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:50:21,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.97 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:21,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:50:21,177 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:50:21,177 INFO L168 Benchmark]: RCFGBuilder took 534.83 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:21,178 INFO L168 Benchmark]: TraceAbstraction took 13142.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 380.0 MB). Peak memory consumption was 504.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:21,183 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.97 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.00 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 534.83 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13142.08 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 380.0 MB). Peak memory consumption was 504.2 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: 23]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 1 <= in) && buflim + 2 <= bufferlen) && in <= 1) && 1 <= buf) && buf <= buflim) || ((((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && in <= 0) && buf + 2 <= bufferlen) && buf <= 0) && 0 <= buf) && 0 <= in)) || ((((((3 <= buf && bufferlen <= buflim + 2) && bufferlen + 1 <= inlen) && 1 <= in) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen) && bufferlen + in + 1 <= buf + inlen)) || ((((((bufferlen + 1 <= inlen && 2 <= buf) && in <= 2) && bufferlen <= buflim + 2) && 1 <= in) && buf + 2 <= bufferlen) && buflim + 2 <= bufferlen) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 451 SDslu, 1610 SDs, 0 SdLazy, 2258 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 375 SyntacticMatches, 17 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=9, 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, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 55 PreInvPairs, 98 NumberOfFragments, 763 HoareAnnotationTreeSize, 55 FomulaSimplifications, 794 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 870 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 246120 SizeOfPredicates, 27 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 1732/2032 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...