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_srvr_2.BV.c.cil.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:39,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:39,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:39,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:39,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:39,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:39,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:39,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:39,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:39,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:39,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:39,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:39,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:39,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:39,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:39,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:39,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:39,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:39,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:39,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:39,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:39,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:39,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:39,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:39,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:39,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:39,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:39,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:39,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:39,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:39,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:39,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:39,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:39,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:39,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:39,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:39,156 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-02 12:16:39,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:39,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:39,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:39,180 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:39,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:39,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:39,181 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:39,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:39,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:39,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:39,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:39,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:39,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:39,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:39,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:39,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:39,183 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:39,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:39,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:39,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:39,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:39,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:39,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:39,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:39,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:39,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:39,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:39,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:39,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:39,185 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:39,185 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:39,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:39,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:39,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:39,257 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:39,257 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:39,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl [2018-10-02 12:16:39,258 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl' [2018-10-02 12:16:39,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:39,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:39,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:39,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:39,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:39,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:39,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:39,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:39,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:39,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/1) ... [2018-10-02 12:16:39,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:39,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:39,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:39,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:39,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (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-02 12:16:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:40,084 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:40,085 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:40 BoogieIcfgContainer [2018-10-02 12:16:40,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:40,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:40,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:40,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:40,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:39" (1/2) ... [2018-10-02 12:16:40,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434bd1b4 and model type s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:40, skipping insertion in model container [2018-10-02 12:16:40,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:40" (2/2) ... [2018-10-02 12:16:40,093 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.BV.c.cil.c_13.bpl [2018-10-02 12:16:40,104 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:40,113 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:40,163 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:40,164 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:40,164 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:40,164 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:40,164 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:40,164 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:40,165 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:40,165 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:40,165 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-02 12:16:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:16:40,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:40,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:40,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:40,204 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash 212232727, now seen corresponding path program 1 times [2018-10-02 12:16:40,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:40,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:40,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:40,417 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-02 12:16:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:40,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:40,441 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:40,443 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-02 12:16:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:40,853 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2018-10-02 12:16:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:40,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-02 12:16:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:40,886 INFO L225 Difference]: With dead ends: 35 [2018-10-02 12:16:40,886 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 12:16:40,890 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 [2018-10-02 12:16:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 12:16:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 12:16:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 12:16:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-10-02 12:16:40,940 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 8 [2018-10-02 12:16:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:40,941 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-10-02 12:16:40,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-10-02 12:16:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:16:40,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:40,942 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:40,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:40,942 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash -250815121, now seen corresponding path program 1 times [2018-10-02 12:16:40,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:40,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:40,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:41,083 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-02 12:16:41,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:41,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:41,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:41,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:41,086 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 3 states. [2018-10-02 12:16:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:41,212 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2018-10-02 12:16:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:41,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-02 12:16:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:41,214 INFO L225 Difference]: With dead ends: 55 [2018-10-02 12:16:41,214 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 12:16:41,215 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 [2018-10-02 12:16:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 12:16:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 12:16:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 12:16:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2018-10-02 12:16:41,226 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 11 [2018-10-02 12:16:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:41,227 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2018-10-02 12:16:41,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-10-02 12:16:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 12:16:41,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:41,232 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:41,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:41,232 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1416638413, now seen corresponding path program 1 times [2018-10-02 12:16:41,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:41,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:41,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-02 12:16:41,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:41,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:41,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:41,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:41,324 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 3 states. [2018-10-02 12:16:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:41,537 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-10-02 12:16:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:41,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-02 12:16:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:41,539 INFO L225 Difference]: With dead ends: 79 [2018-10-02 12:16:41,539 INFO L226 Difference]: Without dead ends: 44 [2018-10-02 12:16:41,540 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 [2018-10-02 12:16:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-02 12:16:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-02 12:16:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-02 12:16:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-10-02 12:16:41,550 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 19 [2018-10-02 12:16:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:41,551 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-10-02 12:16:41,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-10-02 12:16:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:16:41,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:41,552 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:41,553 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:41,553 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1648077349, now seen corresponding path program 1 times [2018-10-02 12:16:41,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:16:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:41,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:41,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:41,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:41,671 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 3 states. [2018-10-02 12:16:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:41,896 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-10-02 12:16:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:41,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 12:16:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:41,899 INFO L225 Difference]: With dead ends: 97 [2018-10-02 12:16:41,899 INFO L226 Difference]: Without dead ends: 54 [2018-10-02 12:16:41,903 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 [2018-10-02 12:16:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-02 12:16:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-02 12:16:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 12:16:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2018-10-02 12:16:41,925 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 22 [2018-10-02 12:16:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:41,926 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-10-02 12:16:41,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2018-10-02 12:16:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:16:41,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:41,927 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:41,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:41,930 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash 494540487, now seen corresponding path program 1 times [2018-10-02 12:16:41,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:41,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:41,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:41,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:16:42,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:42,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:42,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:42,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:42,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,099 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 3 states. [2018-10-02 12:16:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:42,482 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-10-02 12:16:42,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:42,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-02 12:16:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:42,484 INFO L225 Difference]: With dead ends: 80 [2018-10-02 12:16:42,484 INFO L226 Difference]: Without dead ends: 78 [2018-10-02 12:16:42,485 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 [2018-10-02 12:16:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-02 12:16:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-02 12:16:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 12:16:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-10-02 12:16:42,505 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 25 [2018-10-02 12:16:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:42,505 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-10-02 12:16:42,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-10-02 12:16:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-02 12:16:42,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:42,507 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:42,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:42,509 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1543638863, now seen corresponding path program 1 times [2018-10-02 12:16:42,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:42,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:16:42,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:42,658 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-02 12:16:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:42,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:16:42,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:42,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:16:42,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:42,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:42,989 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-10-02 12:16:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:43,310 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2018-10-02 12:16:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:16:43,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-02 12:16:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:43,314 INFO L225 Difference]: With dead ends: 168 [2018-10-02 12:16:43,314 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:43,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:16:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:43,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-10-02 12:16:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:43,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:43,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:43,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:43,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:43,646 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-10-02 12:16:44,215 WARN L178 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-10-02 12:16:44,366 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-10-02 12:16:44,572 INFO L421 ceAbstractionStarter]: At program point L283(lines 283 302) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1)) [2018-10-02 12:16:44,573 INFO L421 ceAbstractionStarter]: At program point L275(lines 238 275) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-10-02 12:16:44,573 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 284) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-10-02 12:16:44,573 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 380) no Hoare annotation was computed. [2018-10-02 12:16:44,574 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 380) no Hoare annotation was computed. [2018-10-02 12:16:44,574 INFO L421 ceAbstractionStarter]: At program point L251(lines 251 267) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-10-02 12:16:44,574 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 378) the Hoare annotation is: false [2018-10-02 12:16:44,574 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 380) no Hoare annotation was computed. [2018-10-02 12:16:44,575 INFO L421 ceAbstractionStarter]: At program point L306(lines 301 325) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:16:44,575 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 379) no Hoare annotation was computed. [2018-10-02 12:16:44,575 INFO L421 ceAbstractionStarter]: At program point L348(lines 348 368) the Hoare annotation is: (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:16:44,576 INFO L421 ceAbstractionStarter]: At program point L377(lines 266 377) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-10-02 12:16:44,576 INFO L421 ceAbstractionStarter]: At program point L340(lines 340 355) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:16:44,576 INFO L421 ceAbstractionStarter]: At program point L295(lines 295 314) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-10-02 12:16:44,576 INFO L421 ceAbstractionStarter]: At program point L357(lines 354 372) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:16:44,577 INFO L421 ceAbstractionStarter]: At program point L324(lines 324 341) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-10-02 12:16:44,592 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:16:44 BoogieIcfgContainer [2018-10-02 12:16:44,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:16:44,594 INFO L168 Benchmark]: Toolchain (without parser) took 5239.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 256.4 MB). Peak memory consumption was 256.4 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:44,595 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:44,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:44,597 INFO L168 Benchmark]: Boogie Preprocessor took 41.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:44,597 INFO L168 Benchmark]: RCFGBuilder took 641.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-02 12:16:44,599 INFO L168 Benchmark]: TraceAbstraction took 4506.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:44,604 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 641.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 4506.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 379]: 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: 271]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8640 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 1 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: 8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 111 SDtfs, 48 SDslu, 52 SDs, 0 SdLazy, 101 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 103 NumberOfFragments, 188 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1189 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 9291 SizeOfPredicates, 2 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 282/290 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_srvr_2.BV.c.cil.c_13.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-16-44-619.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2.BV.c.cil.c_13.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-16-44-619.csv Received shutdown request...