java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:15:25,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:15:25,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:15:25,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:15:25,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:15:25,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:15:25,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:15:25,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:15:25,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:15:25,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:15:25,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:15:25,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:15:25,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:15:25,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:15:25,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:15:25,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:15:25,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:15:25,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:15:25,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:15:25,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:15:25,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:15:25,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:15:25,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:15:25,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:15:25,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:15:25,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:15:25,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:15:25,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:15:25,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:15:25,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:15:25,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:15:25,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:15:25,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:15:25,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:15:25,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:15:25,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:15:25,829 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:15:25,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:15:25,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:15:25,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:15:25,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:15:25,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:15:25,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:15:25,854 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:15:25,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:15:25,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:15:25,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:15:25,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:15:25,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:15:25,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:15:25,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:15:25,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:15:25,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:15:25,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:15:25,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:15:25,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:15:25,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:15:25,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:15:25,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:15:25,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:15:25,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:15:25,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:15:25,860 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:15:25,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:15:25,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:15:25,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:15:25,946 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:15:25,947 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:15:25,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-03 09:15:25,948 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-10-03 09:15:26,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:15:26,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:15:26,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:15:26,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:15:26,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:15:26,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:15:26,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:15:26,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:15:26,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:15:26,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... [2018-10-03 09:15:26,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:15:26,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:15:26,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:15:26,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:15:26,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:15:26,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:15:26,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:15:26,874 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:15:26,874 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:15:26 BoogieIcfgContainer [2018-10-03 09:15:26,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:15:26,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:15:26,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:15:26,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:15:26,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:15:26" (1/2) ... [2018-10-03 09:15:26,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614ec54e and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:15:26, skipping insertion in model container [2018-10-03 09:15:26,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:15:26" (2/2) ... [2018-10-03 09:15:26,882 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-03 09:15:26,891 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:15:26,899 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:15:26,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:15:26,949 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:15:26,949 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:15:26,949 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:15:26,949 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:15:26,949 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:15:26,949 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:15:26,950 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:15:26,950 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:15:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-03 09:15:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 09:15:26,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:26,973 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:26,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:26,983 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-10-03 09:15:26,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:26,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:15:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:27,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:27,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:27,196 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-03 09:15:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:27,418 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-10-03 09:15:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:27,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-03 09:15:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:27,435 INFO L225 Difference]: With dead ends: 37 [2018-10-03 09:15:27,436 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 09:15:27,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 09:15:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-03 09:15:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-03 09:15:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-10-03 09:15:27,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-10-03 09:15:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:27,477 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-10-03 09:15:27,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-10-03 09:15:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 09:15:27,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:27,479 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:27,479 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:27,479 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-10-03 09:15:27,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:27,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:15:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:27,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:27,621 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:27,621 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-10-03 09:15:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:27,789 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-10-03 09:15:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:27,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-03 09:15:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:27,792 INFO L225 Difference]: With dead ends: 41 [2018-10-03 09:15:27,792 INFO L226 Difference]: Without dead ends: 24 [2018-10-03 09:15:27,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-03 09:15:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-03 09:15:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-03 09:15:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-10-03 09:15:27,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-10-03 09:15:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:27,802 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-10-03 09:15:27,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-10-03 09:15:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 09:15:27,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:27,803 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:27,804 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:27,804 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-10-03 09:15:27,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:27,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:27,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 09:15:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:27,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:27,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:27,928 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-10-03 09:15:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:28,008 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-10-03 09:15:28,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:28,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-03 09:15:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:28,011 INFO L225 Difference]: With dead ends: 50 [2018-10-03 09:15:28,011 INFO L226 Difference]: Without dead ends: 29 [2018-10-03 09:15:28,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-03 09:15:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-03 09:15:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 09:15:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-10-03 09:15:28,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-10-03 09:15:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:28,019 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-10-03 09:15:28,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-10-03 09:15:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-03 09:15:28,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:28,021 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:28,021 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:28,021 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-10-03 09:15:28,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:28,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-03 09:15:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:28,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:28,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:28,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:28,140 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-10-03 09:15:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:28,320 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-10-03 09:15:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:28,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-03 09:15:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:28,322 INFO L225 Difference]: With dead ends: 74 [2018-10-03 09:15:28,322 INFO L226 Difference]: Without dead ends: 48 [2018-10-03 09:15:28,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-03 09:15:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-03 09:15:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-03 09:15:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-10-03 09:15:28,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-10-03 09:15:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-10-03 09:15:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-10-03 09:15:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:15:28,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:28,338 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:28,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:28,339 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-10-03 09:15:28,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:28,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-03 09:15:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:28,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:28,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:28,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:28,503 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-10-03 09:15:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:28,666 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-10-03 09:15:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:28,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 09:15:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:28,669 INFO L225 Difference]: With dead ends: 92 [2018-10-03 09:15:28,669 INFO L226 Difference]: Without dead ends: 51 [2018-10-03 09:15:28,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-03 09:15:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-03 09:15:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-03 09:15:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-10-03 09:15:28,680 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-10-03 09:15:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:28,680 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-10-03 09:15:28,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-10-03 09:15:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-03 09:15:28,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:28,682 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:28,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:28,683 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:28,683 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-10-03 09:15:28,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:28,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-03 09:15:28,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:28,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:28,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:28,806 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-10-03 09:15:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:28,895 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-10-03 09:15:28,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:28,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-03 09:15:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:28,898 INFO L225 Difference]: With dead ends: 71 [2018-10-03 09:15:28,899 INFO L226 Difference]: Without dead ends: 69 [2018-10-03 09:15:28,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-03 09:15:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-10-03 09:15:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-03 09:15:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-10-03 09:15:28,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-10-03 09:15:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:28,919 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-10-03 09:15:28,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-10-03 09:15:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 09:15:28,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:28,921 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:28,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:28,921 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-10-03 09:15:28,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:28,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-03 09:15:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:28,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:28,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:28,999 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-10-03 09:15:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:29,160 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-10-03 09:15:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:29,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-03 09:15:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:29,163 INFO L225 Difference]: With dead ends: 161 [2018-10-03 09:15:29,163 INFO L226 Difference]: Without dead ends: 100 [2018-10-03 09:15:29,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-03 09:15:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-03 09:15:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-03 09:15:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-10-03 09:15:29,187 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-10-03 09:15:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:29,188 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-10-03 09:15:29,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-10-03 09:15:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-03 09:15:29,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:29,189 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:29,190 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:29,190 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-10-03 09:15:29,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-03 09:15:29,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:29,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:29,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:29,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:29,287 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-10-03 09:15:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:29,591 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-10-03 09:15:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:29,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-03 09:15:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:29,594 INFO L225 Difference]: With dead ends: 205 [2018-10-03 09:15:29,594 INFO L226 Difference]: Without dead ends: 108 [2018-10-03 09:15:29,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-03 09:15:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-10-03 09:15:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-03 09:15:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-10-03 09:15:29,611 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-10-03 09:15:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:29,612 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-10-03 09:15:29,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-10-03 09:15:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-03 09:15:29,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:29,614 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:29,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:29,614 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-10-03 09:15:29,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:29,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-03 09:15:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:29,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:29,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:29,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:29,752 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-10-03 09:15:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:29,835 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-10-03 09:15:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:29,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-03 09:15:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:29,838 INFO L225 Difference]: With dead ends: 240 [2018-10-03 09:15:29,838 INFO L226 Difference]: Without dead ends: 135 [2018-10-03 09:15:29,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-03 09:15:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-03 09:15:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-03 09:15:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-10-03 09:15:29,859 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-10-03 09:15:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:29,859 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-10-03 09:15:29,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-10-03 09:15:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-03 09:15:29,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:29,862 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:29,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:29,862 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-10-03 09:15:29,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-03 09:15:29,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:29,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:29,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:29,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:29,978 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-10-03 09:15:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:30,278 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-10-03 09:15:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:30,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-03 09:15:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:30,281 INFO L225 Difference]: With dead ends: 297 [2018-10-03 09:15:30,281 INFO L226 Difference]: Without dead ends: 165 [2018-10-03 09:15:30,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-03 09:15:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-03 09:15:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-03 09:15:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-10-03 09:15:30,318 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-10-03 09:15:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:30,319 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-10-03 09:15:30,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-10-03 09:15:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-03 09:15:30,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:30,321 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:30,321 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:30,322 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-10-03 09:15:30,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:30,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-03 09:15:30,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:30,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:30,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:30,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:30,464 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-10-03 09:15:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:30,788 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-10-03 09:15:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:30,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-03 09:15:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:30,790 INFO L225 Difference]: With dead ends: 360 [2018-10-03 09:15:30,790 INFO L226 Difference]: Without dead ends: 198 [2018-10-03 09:15:30,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-03 09:15:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-03 09:15:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-03 09:15:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-10-03 09:15:30,811 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-10-03 09:15:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:30,812 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-10-03 09:15:30,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-10-03 09:15:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-03 09:15:30,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:30,814 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:30,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:30,815 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-10-03 09:15:30,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:30,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-03 09:15:30,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:30,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:30,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:30,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:30,950 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-10-03 09:15:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:31,491 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-10-03 09:15:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:31,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-10-03 09:15:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:31,494 INFO L225 Difference]: With dead ends: 429 [2018-10-03 09:15:31,494 INFO L226 Difference]: Without dead ends: 234 [2018-10-03 09:15:31,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-03 09:15:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-03 09:15:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-03 09:15:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-10-03 09:15:31,514 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-10-03 09:15:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:31,514 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-10-03 09:15:31,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-10-03 09:15:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-03 09:15:31,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:31,517 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:31,518 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:31,518 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-10-03 09:15:31,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:31,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-03 09:15:31,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:15:31,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:15:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:31,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:15:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-03 09:15:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:15:32,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 09:15:32,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:15:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:15:32,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:32,091 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-10-03 09:15:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:32,906 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-10-03 09:15:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:15:32,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-10-03 09:15:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:32,908 INFO L225 Difference]: With dead ends: 530 [2018-10-03 09:15:32,908 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:15:32,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 3 [2018-10-03 09:15:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:15:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:15:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:15:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:15:32,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-10-03 09:15:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:32,910 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:15:32,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:15:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:15:32,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:15:32,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:15:33,603 WARN L178 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-03 09:15:34,362 WARN L178 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-03 09:15:34,938 WARN L178 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-03 09:15:35,501 WARN L178 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-03 09:15:35,830 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-03 09:15:35,933 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-03 09:15:36,243 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-03 09:15:36,688 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-03 09:15:36,923 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-03 09:15:37,083 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-03 09:15:37,168 INFO L421 ceAbstractionStarter]: At program point L440(lines 440 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,168 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,168 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,169 INFO L421 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4) (= ULTIMATE.start_ssl3_connect_~s__state~3 4432)) [2018-10-03 09:15:37,169 INFO L421 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,169 INFO L421 ceAbstractionStarter]: At program point L296(lines 296 307) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-03 09:15:37,169 INFO L421 ceAbstractionStarter]: At program point L420(lines 420 437) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,169 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,170 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,170 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-10-03 09:15:37,170 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-10-03 09:15:37,170 INFO L421 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,170 INFO L421 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,170 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,171 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-10-03 09:15:37,171 INFO L421 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-10-03 09:15:37,171 INFO L421 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,171 INFO L421 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-03 09:15:37,171 INFO L421 ceAbstractionStarter]: At program point L311(lines 306 330) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-03 09:15:37,172 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-10-03 09:15:37,199 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:15:37 BoogieIcfgContainer [2018-10-03 09:15:37,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:15:37,204 INFO L168 Benchmark]: Toolchain (without parser) took 11168.54 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -17.9 MB). Peak memory consumption was 490.2 MB. Max. memory is 7.1 GB. [2018-10-03 09:15:37,205 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:15:37,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:15:37,209 INFO L168 Benchmark]: Boogie Preprocessor took 35.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:15:37,210 INFO L168 Benchmark]: RCFGBuilder took 742.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:15:37,211 INFO L168 Benchmark]: TraceAbstraction took 10324.32 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.6 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. [2018-10-03 09:15:37,220 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 742.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10324.32 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.6 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4432 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 10.2s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=12, 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, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 71345 SizeOfPredicates, 2 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2279/2289 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-15-37-245.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-15-37-245.csv Received shutdown request...