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-673a906-m [2019-10-02 11:18:31,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:18:31,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:18:31,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:18:31,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:18:31,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:18:31,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:18:31,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:18:31,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:18:31,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:18:31,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:18:31,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:18:31,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:18:31,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:18:31,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:18:31,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:18:31,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:18:31,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:18:31,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:18:31,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:18:31,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:18:31,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:18:31,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:18:31,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:18:31,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:18:31,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:18:31,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:18:31,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:18:31,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:18:31,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:18:31,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:18:31,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:18:31,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:18:31,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:18:31,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:18:31,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:18:31,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:18:31,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:18:31,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:18:31,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:18:31,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:18:31,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:18:31,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:18:31,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:18:31,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:18:31,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:18:31,854 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:18:31,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:18:31,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:18:31,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:18:31,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:18:31,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:18:31,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:18:31,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:18:31,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:18:31,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:18:31,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:18:31,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:18:31,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:18:31,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:18:31,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:18:31,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:18:31,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:18:31,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:31,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:18:31,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:18:31,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:18:31,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:18:31,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:18:31,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:18:31,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:18:31,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:18:31,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:18:31,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:18:31,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:18:31,933 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:18:31,934 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-10-02 11:18:31,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a18bc220/75fb88ff415a4c7e9ea75f0472526b7b/FLAGb2af83745 [2019-10-02 11:18:32,382 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:18:32,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-02 11:18:32,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a18bc220/75fb88ff415a4c7e9ea75f0472526b7b/FLAGb2af83745 [2019-10-02 11:18:32,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a18bc220/75fb88ff415a4c7e9ea75f0472526b7b [2019-10-02 11:18:32,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:18:32,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:18:32,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:32,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:18:32,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:18:32,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:32" (1/1) ... [2019-10-02 11:18:32,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6561a44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:32, skipping insertion in model container [2019-10-02 11:18:32,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:32" (1/1) ... [2019-10-02 11:18:32,787 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:18:32,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:18:32,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:32,983 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:18:33,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:33,013 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:18:33,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33 WrapperNode [2019-10-02 11:18:33,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:33,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:18:33,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:18:33,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:18:33,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... [2019-10-02 11:18:33,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:18:33,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:18:33,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:18:33,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:18:33,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:33,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:18:33,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:18:33,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:18:33,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:18:33,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:18:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:18:33,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:18:33,382 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:18:33,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:33 BoogieIcfgContainer [2019-10-02 11:18:33,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:18:33,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:18:33,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:18:33,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:18:33,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:18:32" (1/3) ... [2019-10-02 11:18:33,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7b7df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:33, skipping insertion in model container [2019-10-02 11:18:33,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:33" (2/3) ... [2019-10-02 11:18:33,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7b7df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:33, skipping insertion in model container [2019-10-02 11:18:33,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:33" (3/3) ... [2019-10-02 11:18:33,394 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-10-02 11:18:33,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:18:33,423 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:18:33,441 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:18:33,477 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:18:33,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:18:33,479 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:18:33,479 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:18:33,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:18:33,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:18:33,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:18:33,480 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:18:33,480 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:18:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-02 11:18:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:18:33,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:33,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:33,511 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-10-02 11:18:33,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:33,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:33,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:33,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:18:33,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:18:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:18:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:18:33,654 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-02 11:18:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:33,683 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-10-02 11:18:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:18:33,684 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 11:18:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:33,694 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:18:33,695 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 11:18:33,699 INFO L640 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-10-02 11:18:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 11:18:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-02 11:18:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:18:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-02 11:18:33,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-10-02 11:18:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:33,748 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-02 11:18:33,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:18:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-02 11:18:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:18:33,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:33,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:33,751 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-10-02 11:18:33,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:33,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:33,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:33,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:33,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:33,888 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-10-02 11:18:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:34,008 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-02 11:18:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:34,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-02 11:18:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:34,010 INFO L225 Difference]: With dead ends: 35 [2019-10-02 11:18:34,011 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 11:18:34,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 11:18:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-02 11:18:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:18:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-02 11:18:34,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-10-02 11:18:34,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:34,028 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-02 11:18:34,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-02 11:18:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:18:34,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:34,030 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:34,031 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-10-02 11:18:34,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:34,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:34,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:34,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:18:34,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:18:34,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:18:34,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:34,133 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-10-02 11:18:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:34,281 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-10-02 11:18:34,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:18:34,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:18:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:34,283 INFO L225 Difference]: With dead ends: 48 [2019-10-02 11:18:34,283 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:18:34,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:18:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:18:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-02 11:18:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 11:18:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-02 11:18:34,297 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-10-02 11:18:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:34,297 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-02 11:18:34,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:18:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-02 11:18:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:18:34,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:34,299 INFO L411 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-10-02 11:18:34,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-10-02 11:18:34,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:34,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:34,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:18:34,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:34,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:18:34,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:18:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:18:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:34,369 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-10-02 11:18:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:34,485 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-10-02 11:18:34,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:18:34,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-02 11:18:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:34,488 INFO L225 Difference]: With dead ends: 55 [2019-10-02 11:18:34,488 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 11:18:34,489 INFO L640 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-10-02 11:18:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 11:18:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-02 11:18:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 11:18:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-10-02 11:18:34,514 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-10-02 11:18:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:34,514 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-10-02 11:18:34,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:18:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-10-02 11:18:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:18:34,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:34,518 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:34,518 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-10-02 11:18:34,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:18:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:18:34,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:18:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:18:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:34,629 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-10-02 11:18:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:34,830 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-10-02 11:18:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:18:34,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-02 11:18:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:34,832 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:18:34,832 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 11:18:34,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:18:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 11:18:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 11:18:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 11:18:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-10-02 11:18:34,846 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-10-02 11:18:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:34,847 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-10-02 11:18:34,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:18:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-10-02 11:18:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 11:18:34,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:34,851 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:34,852 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-10-02 11:18:34,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:18:34,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:34,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:18:34,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:18:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:18:34,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:18:34,926 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-10-02 11:18:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:35,106 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-10-02 11:18:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:18:35,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-10-02 11:18:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:35,110 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:18:35,111 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:18:35,112 INFO L640 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-10-02 11:18:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:18:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-10-02 11:18:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 11:18:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-02 11:18:35,132 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-10-02 11:18:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:35,135 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-02 11:18:35,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:18:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-02 11:18:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:18:35,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:35,137 INFO L411 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-10-02 11:18:35,137 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-10-02 11:18:35,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:35,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:35,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 11:18:35,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:35,280 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-10-02 11:18:35,313 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-10-02 11:18:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:35,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 11:18:35,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 11:18:35,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:35,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-10-02 11:18:35,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:18:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:18:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:18:35,591 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-10-02 11:18:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:36,326 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-10-02 11:18:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:18:36,326 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-10-02 11:18:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:36,331 INFO L225 Difference]: With dead ends: 111 [2019-10-02 11:18:36,331 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 11:18:36,333 INFO L640 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-10-02 11:18:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 11:18:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-10-02 11:18:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 11:18:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-10-02 11:18:36,355 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-10-02 11:18:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:36,356 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-10-02 11:18:36,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:18:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-10-02 11:18:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:18:36,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:36,357 INFO L411 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-10-02 11:18:36,358 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-10-02 11:18:36,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:36,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 11:18:36,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:36,447 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:18:36,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:36,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 11:18:36,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:18:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:36,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-10-02 11:18:36,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:18:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:18:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:18:36,576 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-10-02 11:18:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:36,766 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-10-02 11:18:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:18:36,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-10-02 11:18:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:36,769 INFO L225 Difference]: With dead ends: 97 [2019-10-02 11:18:36,769 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 11:18:36,771 INFO L640 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-10-02 11:18:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 11:18:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-02 11:18:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 11:18:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-02 11:18:36,804 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-10-02 11:18:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:36,804 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-02 11:18:36,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:18:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-02 11:18:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:18:36,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:36,806 INFO L411 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-10-02 11:18:36,807 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-10-02 11:18:36,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:36,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:36,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:36,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 11:18:36,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:36,968 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) [2019-10-02 11:18:36,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:18:37,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:18:37,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:37,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:18:37,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-02 11:18:37,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:37,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-10-02 11:18:37,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:18:37,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:18:37,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:18:37,272 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 23 states. [2019-10-02 11:18:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:38,127 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-10-02 11:18:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:18:38,128 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-10-02 11:18:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:38,130 INFO L225 Difference]: With dead ends: 116 [2019-10-02 11:18:38,130 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 11:18:38,131 INFO L640 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-10-02 11:18:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 11:18:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-10-02 11:18:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 11:18:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-10-02 11:18:38,143 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2019-10-02 11:18:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:38,144 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-10-02 11:18:38,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:18:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-10-02 11:18:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 11:18:38,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:38,146 INFO L411 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-10-02 11:18:38,147 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-10-02 11:18:38,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:38,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-02 11:18:38,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:38,326 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:18:38,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:18:38,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:18:38,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:18:38,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:38,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-02 11:18:38,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:38,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-10-02 11:18:38,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:18:38,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:18:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:18:38,673 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2019-10-02 11:18:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:39,200 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-10-02 11:18:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:18:39,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-02 11:18:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:39,204 INFO L225 Difference]: With dead ends: 109 [2019-10-02 11:18:39,204 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:18:39,205 INFO L640 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-10-02 11:18:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:18:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-02 11:18:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:18:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-10-02 11:18:39,224 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 106 [2019-10-02 11:18:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:39,226 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-10-02 11:18:39,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:18:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-10-02 11:18:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 11:18:39,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:39,229 INFO L411 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-10-02 11:18:39,229 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1512190145, now seen corresponding path program 3 times [2019-10-02 11:18:39,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:39,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:39,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:39,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:39,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-10-02 11:18:39,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:39,479 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-10-02 11:18:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:18:39,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 11:18:39,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:18:39,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:18:39,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:18:39,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 100 proven. 62 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-02 11:18:39,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:39,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-10-02 11:18:39,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 11:18:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 11:18:39,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:18:39,909 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 28 states. [2019-10-02 11:18:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:41,068 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-10-02 11:18:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 11:18:41,069 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2019-10-02 11:18:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:41,070 INFO L225 Difference]: With dead ends: 119 [2019-10-02 11:18:41,070 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:18:41,072 INFO L640 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-10-02 11:18:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:18:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:18:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:18:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:18:41,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-10-02 11:18:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:41,074 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:18:41,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 11:18:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:18:41,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:18:41,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:18:41,395 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-10-02 11:18:41,603 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-10-02 11:18:41,788 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-10-02 11:18:42,062 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:18:42,062 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:42,062 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:42,062 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:18:42,062 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:42,062 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:42,063 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-10-02 11:18:42,063 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-10-02 11:18:42,063 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-10-02 11:18:42,063 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-10-02 11:18:42,064 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-10-02 11:18:42,064 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-02 11:18:42,064 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-02 11:18:42,064 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-10-02 11:18:42,064 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-10-02 11:18:42,064 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 11:18:42,064 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-10-02 11:18:42,065 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-10-02 11:18:42,065 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-10-02 11:18:42,065 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-02 11:18:42,065 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-10-02 11:18:42,065 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-10-02 11:18:42,065 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-10-02 11:18:42,065 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-10-02 11:18:42,065 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-10-02 11:18:42,065 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-10-02 11:18:42,066 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-10-02 11:18:42,066 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-02 11:18:42,066 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-10-02 11:18:42,066 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-02 11:18:42,066 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-02 11:18:42,066 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:18:42,066 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-02 11:18:42,067 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-02 11:18:42,067 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-02 11:18:42,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:18:42 BoogieIcfgContainer [2019-10-02 11:18:42,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:18:42,088 INFO L168 Benchmark]: Toolchain (without parser) took 9319.47 ms. Allocated memory was 141.0 MB in the beginning and 338.2 MB in the end (delta: 197.1 MB). Free memory was 88.9 MB in the beginning and 139.4 MB in the end (delta: -50.5 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,089 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.12 ms. Allocated memory is still 141.0 MB. Free memory was 88.7 MB in the beginning and 79.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,090 INFO L168 Benchmark]: Boogie Preprocessor took 117.96 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 79.1 MB in the beginning and 177.8 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,091 INFO L168 Benchmark]: RCFGBuilder took 251.91 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 163.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,092 INFO L168 Benchmark]: TraceAbstraction took 8699.70 ms. Allocated memory was 200.3 MB in the beginning and 338.2 MB in the end (delta: 137.9 MB). Free memory was 163.2 MB in the beginning and 139.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 216.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:42,097 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.43 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.12 ms. Allocated memory is still 141.0 MB. Free memory was 88.7 MB in the beginning and 79.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.96 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 79.1 MB in the beginning and 177.8 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 251.91 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 163.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8699.70 ms. Allocated memory was 200.3 MB in the beginning and 338.2 MB in the end (delta: 137.9 MB). Free memory was 163.2 MB in the beginning and 139.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 216.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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, 8.5s OverallTime, 11 OverallIterations, 16 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 472 SDslu, 2312 SDs, 0 SdLazy, 2289 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 375 SyntacticMatches, 9 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 3.0s 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.2s 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.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s 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...