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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:20,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:20,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:20,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:20,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:20,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:20,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:20,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:20,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:20,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:20,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:20,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:20,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:20,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:20,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:20,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:20,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:20,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:20,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:20,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:20,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:20,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:20,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:20,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:20,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:20,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:20,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:20,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:20,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:20,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:20,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:20,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:20,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:20,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:20,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:20,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:20,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:20,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:20,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:20,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:20,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:20,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:58:20,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:20,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:20,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:20,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:20,411 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:20,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:20,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:20,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:20,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:20,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:20,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:20,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:20,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:20,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:20,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:20,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:20,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:20,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:20,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:20,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:20,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:20,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:20,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:20,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:20,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:20,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:20,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:20,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:20,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:20,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:20,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:20,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:20,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:20,469 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:20,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-20 12:58:20,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ed89a90/58cabaea1b634fb18ee1ffab0ae97ce5/FLAG97fe48167 [2019-09-20 12:58:21,012 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:21,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-20 12:58:21,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ed89a90/58cabaea1b634fb18ee1ffab0ae97ce5/FLAG97fe48167 [2019-09-20 12:58:21,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ed89a90/58cabaea1b634fb18ee1ffab0ae97ce5 [2019-09-20 12:58:21,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:21,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:21,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:21,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:21,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:21,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731ef654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21, skipping insertion in model container [2019-09-20 12:58:21,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:21,426 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:21,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:21,624 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:21,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:21,661 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:21,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21 WrapperNode [2019-09-20 12:58:21,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:21,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:21,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:21,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:21,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:21,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:21,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:21,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:21,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:21,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:21,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:58:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:21,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:22,077 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:22,078 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:58:22,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:22 BoogieIcfgContainer [2019-09-20 12:58:22,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:22,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:22,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:22,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:22,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:21" (1/3) ... [2019-09-20 12:58:22,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c24c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:22, skipping insertion in model container [2019-09-20 12:58:22,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (2/3) ... [2019-09-20 12:58:22,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c24c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:22, skipping insertion in model container [2019-09-20 12:58:22,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:22" (3/3) ... [2019-09-20 12:58:22,102 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-09-20 12:58:22,124 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:22,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:58:22,150 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:58:22,184 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:22,185 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:22,185 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:22,185 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:22,185 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:22,186 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:22,186 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:22,186 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:22,186 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-20 12:58:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:58:22,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,207 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-09-20 12:58:22,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:58:22,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:58:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:58:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:58:22,344 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-20 12:58:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,367 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-09-20 12:58:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:58:22,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-20 12:58:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,376 INFO L225 Difference]: With dead ends: 61 [2019-09-20 12:58:22,377 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 12:58:22,381 INFO L636 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 [2019-09-20 12:58:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 12:58:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-20 12:58:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:58:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-09-20 12:58:22,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-09-20 12:58:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,423 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-09-20 12:58:22,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:58:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-09-20 12:58:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 12:58:22,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,426 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,426 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-09-20 12:58:22,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:22,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:22,525 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-09-20 12:58:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,632 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-20 12:58:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:22,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-20 12:58:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,634 INFO L225 Difference]: With dead ends: 35 [2019-09-20 12:58:22,634 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 12:58:22,636 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 12:58:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-20 12:58:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 12:58:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-20 12:58:22,648 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-09-20 12:58:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,649 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-20 12:58:22,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-20 12:58:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:58:22,650 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,650 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,651 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-09-20 12:58:22,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:22,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:22,732 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-09-20 12:58:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,899 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-09-20 12:58:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:22,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-20 12:58:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,901 INFO L225 Difference]: With dead ends: 48 [2019-09-20 12:58:22,901 INFO L226 Difference]: Without dead ends: 46 [2019-09-20 12:58:22,902 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-20 12:58:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-20 12:58:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 12:58:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-20 12:58:22,915 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-09-20 12:58:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,916 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-20 12:58:22,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-20 12:58:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:58:22,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,918 INFO L407 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, 1, 1] [2019-09-20 12:58:22,918 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-09-20 12:58:22,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:23,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:23,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:23,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:23,021 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-09-20 12:58:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:23,152 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-09-20 12:58:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:23,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-20 12:58:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:23,154 INFO L225 Difference]: With dead ends: 55 [2019-09-20 12:58:23,155 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 12:58:23,158 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 12:58:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-09-20 12:58:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-20 12:58:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-09-20 12:58:23,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-09-20 12:58:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:23,187 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-09-20 12:58:23,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-09-20 12:58:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:23,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:23,189 INFO L407 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] [2019-09-20 12:58:23,189 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-09-20 12:58:23,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:23,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:23,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:23,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:23,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:23,318 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-09-20 12:58:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:23,540 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-09-20 12:58:23,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:23,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 12:58:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:23,542 INFO L225 Difference]: With dead ends: 70 [2019-09-20 12:58:23,542 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 12:58:23,543 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 12:58:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-20 12:58:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-20 12:58:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-09-20 12:58:23,565 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-09-20 12:58:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:23,565 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-09-20 12:58:23,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-09-20 12:58:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 12:58:23,566 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:23,567 INFO L407 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, 1, 1] [2019-09-20 12:58:23,567 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-09-20 12:58:23,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:58:23,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:58:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:58:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:23,660 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-09-20 12:58:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:23,848 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-09-20 12:58:23,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:58:23,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-20 12:58:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:23,850 INFO L225 Difference]: With dead ends: 72 [2019-09-20 12:58:23,850 INFO L226 Difference]: Without dead ends: 70 [2019-09-20 12:58:23,851 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-20 12:58:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-09-20 12:58:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 12:58:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-20 12:58:23,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-09-20 12:58:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:23,878 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-20 12:58:23,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:58:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-20 12:58:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 12:58:23,886 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:23,886 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1] [2019-09-20 12:58:23,890 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-09-20 12:58:23,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:58:24,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:24,046 INFO L224 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) [2019-09-20 12:58:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:24,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 12:58:24,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:24,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-20 12:58:24,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-09-20 12:58:24,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 12:58:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 12:58:24,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:58:24,341 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-09-20 12:58:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,033 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-09-20 12:58:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 12:58:25,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-20 12:58:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,037 INFO L225 Difference]: With dead ends: 111 [2019-09-20 12:58:25,037 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 12:58:25,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-09-20 12:58:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 12:58:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-09-20 12:58:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 12:58:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-09-20 12:58:25,053 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-09-20 12:58:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,054 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-09-20 12:58:25,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 12:58:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-09-20 12:58:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 12:58:25,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,055 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:25,055 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-09-20 12:58:25,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:58:25,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:25,194 INFO L224 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) [2019-09-20 12:58:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:25,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:25,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 12:58:25,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:25,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-20 12:58:25,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:58:25,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:58:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:58:25,341 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-09-20 12:58:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,547 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-09-20 12:58:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:58:25,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-09-20 12:58:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,550 INFO L225 Difference]: With dead ends: 97 [2019-09-20 12:58:25,550 INFO L226 Difference]: Without dead ends: 95 [2019-09-20 12:58:25,551 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:58:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-20 12:58:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-20 12:58:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-20 12:58:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-09-20 12:58:25,574 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-09-20 12:58:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,574 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-09-20 12:58:25,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:58:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-09-20 12:58:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 12:58:25,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,579 INFO L407 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:25,579 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-09-20 12:58:25,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-20 12:58:25,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:25,789 INFO L224 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 [2019-09-20 12:58:25,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:25,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:25,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:25,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-20 12:58:25,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:26,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:58:26,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:26,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-20 12:58:26,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-20 12:58:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-20 12:58:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-09-20 12:58:26,094 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 23 states. [2019-09-20 12:58:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:27,116 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-20 12:58:27,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 12:58:27,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-09-20 12:58:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:27,119 INFO L225 Difference]: With dead ends: 116 [2019-09-20 12:58:27,119 INFO L226 Difference]: Without dead ends: 114 [2019-09-20 12:58:27,120 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-20 12:58:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-20 12:58:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-09-20 12:58:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-20 12:58:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-09-20 12:58:27,133 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2019-09-20 12:58:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:27,133 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-09-20 12:58:27,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-20 12:58:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-09-20 12:58:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 12:58:27,136 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:27,136 INFO L407 BasicCegarLoop]: trace histogram [16, 15, 15, 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, 1, 1, 1] [2019-09-20 12:58:27,136 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-09-20 12:58:27,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:27,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:27,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-09-20 12:58:27,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:27,352 INFO L224 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) [2019-09-20 12:58:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:27,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:27,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:27,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-20 12:58:27,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:27,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-20 12:58:27,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-09-20 12:58:27,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 12:58:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 12:58:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:58:27,676 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2019-09-20 12:58:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:28,293 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-20 12:58:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 12:58:28,293 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-20 12:58:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:28,295 INFO L225 Difference]: With dead ends: 109 [2019-09-20 12:58:28,295 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 12:58:28,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-09-20 12:58:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 12:58:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-20 12:58:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 12:58:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-09-20 12:58:28,308 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 106 [2019-09-20 12:58:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:28,308 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-09-20 12:58:28,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 12:58:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-09-20 12:58:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 12:58:28,311 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:28,311 INFO L407 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:28,311 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1512190145, now seen corresponding path program 3 times [2019-09-20 12:58:28,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:28,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-09-20 12:58:28,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:28,550 INFO L224 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 [2019-09-20 12:58:28,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:58:28,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-20 12:58:28,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:28,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:58:28,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:28,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 100 proven. 62 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:58:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-09-20 12:58:28,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-20 12:58:28,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-20 12:58:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-09-20 12:58:28,982 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 28 states. [2019-09-20 12:58:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:30,205 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-09-20 12:58:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-20 12:58:30,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2019-09-20 12:58:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:30,206 INFO L225 Difference]: With dead ends: 119 [2019-09-20 12:58:30,207 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:30,209 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=390, Invalid=1866, Unknown=0, NotChecked=0, Total=2256 [2019-09-20 12:58:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:30,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-09-20 12:58:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:30,210 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:30,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-20 12:58:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:30,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:30,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:30,535 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-20 12:58:30,774 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-20 12:58:31,017 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-20 12:58:31,222 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-20 12:58:31,345 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-20 12:58:31,348 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 12:58:31,348 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:31,349 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:31,349 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:58:31,349 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:31,349 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:31,350 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-20 12:58:31,350 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-20 12:58:31,350 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-09-20 12:58:31,350 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-09-20 12:58:31,350 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-20 12:58:31,351 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-09-20 12:58:31,351 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-20 12:58:31,351 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-20 12:58:31,351 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-20 12:58:31,352 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-20 12:58:31,352 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-09-20 12:58:31,352 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse3 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse2 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse4 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and .cse0 .cse1 (<= main_~in~0 2) .cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse2 (<= 3 main_~buf~0) .cse0 .cse3 .cse4) (and .cse2 (<= 0 main_~in~0) .cse3 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= main_~in~0 1) .cse1 .cse2 (<= 1 main_~buf~0) .cse4))) [2019-09-20 12:58:31,352 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-09-20 12:58:31,352 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-20 12:58:31,353 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-09-20 12:58:31,353 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-09-20 12:58:31,353 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-20 12:58:31,353 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-20 12:58:31,353 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-20 12:58:31,353 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-09-20 12:58:31,353 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-09-20 12:58:31,354 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-20 12:58:31,354 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-20 12:58:31,354 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-20 12:58:31,354 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-20 12:58:31,354 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:31,354 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-20 12:58:31,355 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-20 12:58:31,355 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:31,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:58:31 BoogieIcfgContainer [2019-09-20 12:58:31,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:58:31,380 INFO L168 Benchmark]: Toolchain (without parser) took 9986.84 ms. Allocated memory was 138.9 MB in the beginning and 358.1 MB in the end (delta: 219.2 MB). Free memory was 86.3 MB in the beginning and 259.0 MB in the end (delta: -172.7 MB). Peak memory consumption was 225.0 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:31,381 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory is still 104.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 12:58:31,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.02 ms. Allocated memory is still 138.9 MB. Free memory was 86.3 MB in the beginning and 76.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:31,384 INFO L168 Benchmark]: Boogie Preprocessor took 123.17 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 76.5 MB in the beginning and 176.1 MB in the end (delta: -99.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:31,385 INFO L168 Benchmark]: RCFGBuilder took 292.89 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 162.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:31,387 INFO L168 Benchmark]: TraceAbstraction took 9289.84 ms. Allocated memory was 199.2 MB in the beginning and 358.1 MB in the end (delta: 158.9 MB). Free memory was 162.4 MB in the beginning and 259.0 MB in the end (delta: -96.6 MB). Peak memory consumption was 240.8 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:31,397 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.19 ms. Allocated memory is still 138.9 MB. Free memory is still 104.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.02 ms. Allocated memory is still 138.9 MB. Free memory was 86.3 MB in the beginning and 76.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.17 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 76.5 MB in the beginning and 176.1 MB in the end (delta: -99.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.89 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 162.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9289.84 ms. Allocated memory was 199.2 MB in the beginning and 358.1 MB in the end (delta: 158.9 MB). Free memory was 162.4 MB in the beginning and 259.0 MB in the end (delta: -96.6 MB). Peak memory consumption was 240.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((1 <= in && bufferlen < inlen) && in <= 2) && bufferlen == buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || (((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && 3 <= buf) && 1 <= in) && in + buflim + 3 <= buf + inlen) && buf < buflim + 1)) || (((((bufferlen == buflim + 2 && 0 <= in) && in + buflim + 3 <= buf + inlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || (((((1 <= in && in <= 1) && bufferlen < inlen) && bufferlen == buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 11 OverallIterations, 16 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 472 SDslu, 2312 SDs, 0 SdLazy, 2289 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 375 SyntacticMatches, 9 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 64 PreInvPairs, 113 NumberOfFragments, 513 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1510 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 963 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 291238 SizeOfPredicates, 25 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2703/2972 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...