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/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:55:15,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:55:15,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:55:15,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:55:15,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:55:15,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:55:15,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:55:15,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:55:15,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:55:15,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:55:15,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:55:15,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:55:15,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:55:15,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:55:15,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:55:15,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:55:15,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:55:15,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:55:15,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:55:15,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:55:15,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:55:15,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:55:15,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:55:15,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:55:15,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:55:15,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:55:15,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:55:15,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:55:15,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:55:15,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:55:15,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:55:15,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:55:15,195 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:55:15,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:55:15,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:55:15,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:55:15,197 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-09-30 10:55:15,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:55:15,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:55:15,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:55:15,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:55:15,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:55:15,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:55:15,215 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:55:15,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:55:15,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:55:15,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:55:15,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:55:15,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:55:15,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:55:15,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:55:15,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:55:15,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:55:15,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:55:15,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:55:15,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:55:15,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:55:15,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:55:15,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:55:15,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:55:15,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:55:15,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:55:15,220 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:55:15,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:55:15,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:55:15,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:55:15,287 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:55:15,287 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:55:15,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-30 10:55:15,288 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl' [2018-09-30 10:55:15,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:55:15,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:55:15,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:55:15,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:55:15,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:55:15,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:55:15,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:55:15,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:55:15,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:55:15,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/1) ... [2018-09-30 10:55:15,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:55:15,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:55:15,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:55:15,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:55:15,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (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-09-30 10:55:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:55:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:55:16,260 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:55:16,260 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:55:16 BoogieIcfgContainer [2018-09-30 10:55:16,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:55:16,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:55:16,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:55:16,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:55:16,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:15" (1/2) ... [2018-09-30 10:55:16,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435ccedf and model type pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:55:16, skipping insertion in model container [2018-09-30 10:55:16,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:55:16" (2/2) ... [2018-09-30 10:55:16,270 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-30 10:55:16,281 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:55:16,291 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:55:16,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:55:16,355 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:55:16,355 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:55:16,355 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:55:16,357 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:55:16,358 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:55:16,358 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:55:16,358 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:55:16,358 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:55:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-30 10:55:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:55:16,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:16,384 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:16,385 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:16,391 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-30 10:55:16,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:16,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:16,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:16,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:16,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:16,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:16,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:16,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:16,650 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-30 10:55:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:16,757 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-30 10:55:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:16,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:55:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:16,771 INFO L225 Difference]: With dead ends: 48 [2018-09-30 10:55:16,772 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:55:16,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:55:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-30 10:55:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:55:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-30 10:55:16,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-30 10:55:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:16,822 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-30 10:55:16,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-30 10:55:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:55:16,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:16,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:16,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:16,824 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-30 10:55:16,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:16,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:16,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:16,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:16,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:16,945 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:16,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:16,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:16,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:16,950 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-30 10:55:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:17,074 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-30 10:55:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:17,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:55:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:17,079 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:55:17,080 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:55:17,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:55:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-30 10:55:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 10:55:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-30 10:55:17,100 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-30 10:55:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:17,100 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-30 10:55:17,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-30 10:55:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:55:17,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:17,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:17,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:17,102 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-30 10:55:17,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:17,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:17,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:17,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:17,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:17,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:17,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:17,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:17,249 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-30 10:55:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:17,356 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-30 10:55:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:17,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:55:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:17,369 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:55:17,369 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:55:17,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:55:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-30 10:55:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:55:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-30 10:55:17,427 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-30 10:55:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:17,427 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-30 10:55:17,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-30 10:55:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:55:17,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:17,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:17,429 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:17,429 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-30 10:55:17,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:17,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:17,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:17,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:17,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:17,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:17,575 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-30 10:55:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:17,791 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-30 10:55:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:17,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:55:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:17,794 INFO L225 Difference]: With dead ends: 269 [2018-09-30 10:55:17,794 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 10:55:17,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 10:55:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-30 10:55:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 10:55:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-30 10:55:17,833 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-30 10:55:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:17,833 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-30 10:55:17,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-30 10:55:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:55:17,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:17,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:17,835 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:17,835 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-30 10:55:17,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:17,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:18,092 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:18,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:55:18,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:55:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:55:18,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:18,093 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-30 10:55:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:18,312 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-30 10:55:18,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:55:18,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-30 10:55:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:18,319 INFO L225 Difference]: With dead ends: 293 [2018-09-30 10:55:18,319 INFO L226 Difference]: Without dead ends: 291 [2018-09-30 10:55:18,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-30 10:55:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-30 10:55:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 10:55:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-30 10:55:18,365 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-30 10:55:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:18,365 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-30 10:55:18,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:55:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-30 10:55:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:55:18,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:18,371 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:18,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:18,372 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-30 10:55:18,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:18,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:18,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:18,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:18,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:18,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:55:18,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:18,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:18,526 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-30 10:55:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:18,663 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-30 10:55:18,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:18,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-30 10:55:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:18,670 INFO L225 Difference]: With dead ends: 525 [2018-09-30 10:55:18,671 INFO L226 Difference]: Without dead ends: 351 [2018-09-30 10:55:18,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-30 10:55:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-30 10:55:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-30 10:55:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-30 10:55:18,746 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-30 10:55:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:18,747 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-30 10:55:18,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-30 10:55:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:55:18,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:18,750 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:18,750 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:18,750 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-30 10:55:18,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:18,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:18,924 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:55:18,924 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-09-30 10:55:18,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:19,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:55:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:55:19,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:55:19,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:55:19,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:55:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:55:19,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:19,242 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-09-30 10:55:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:22,678 INFO L93 Difference]: Finished difference Result 767 states and 986 transitions. [2018-09-30 10:55:22,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:55:22,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-09-30 10:55:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:22,683 INFO L225 Difference]: With dead ends: 767 [2018-09-30 10:55:22,683 INFO L226 Difference]: Without dead ends: 272 [2018-09-30 10:55:22,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-30 10:55:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2018-09-30 10:55:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-30 10:55:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2018-09-30 10:55:22,731 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 28 [2018-09-30 10:55:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:22,731 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2018-09-30 10:55:22,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:55:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2018-09-30 10:55:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 10:55:22,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:22,735 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:55:22,735 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:22,735 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1903869193, now seen corresponding path program 2 times [2018-09-30 10:55:22,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-30 10:55:22,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:22,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:22,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:22,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:22,820 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand 3 states. [2018-09-30 10:55:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:22,830 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-09-30 10:55:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:22,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-09-30 10:55:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:22,831 INFO L225 Difference]: With dead ends: 251 [2018-09-30 10:55:22,832 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:55:22,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:55:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:55:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:55:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:55:22,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-30 10:55:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:22,834 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:55:22,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:55:22,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:55:22,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:55:23,507 WARN L178 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-09-30 10:55:23,640 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-09-30 10:55:23,765 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-09-30 10:55:24,416 WARN L178 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-09-30 10:55:24,667 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-09-30 10:55:24,848 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-09-30 10:55:24,965 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-09-30 10:55:25,086 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-09-30 10:55:25,207 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-09-30 10:55:25,215 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (<= ~r1 1) .cse4 .cse5))) [2018-09-30 10:55:25,215 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:55:25,215 INFO L422 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (<= ~r1 1) .cse4 .cse5) (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-09-30 10:55:25,215 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:55:25,216 INFO L422 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse6 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse6 (<= ~r1 1) .cse4 .cse5) (and .cse1 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse6 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-09-30 10:55:25,216 INFO L422 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-09-30 10:55:25,216 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:55:25,216 INFO L422 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse6 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse6 (<= ~r1 1) .cse4 .cse5) (and .cse1 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse6 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-09-30 10:55:25,216 INFO L422 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-30 10:55:25,217 INFO L422 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (<= ~r1 1) .cse4 .cse5) (and .cse0 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-09-30 10:55:25,217 INFO L422 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-30 10:55:25,217 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-09-30 10:55:25,217 INFO L422 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (<= ~r1 1) .cse4 .cse5) (and .cse0 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-09-30 10:55:25,218 INFO L422 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-30 10:55:25,218 INFO L422 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-09-30 10:55:25,218 INFO L422 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-09-30 10:55:25,218 INFO L422 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send1) (<= 1 ULTIMATE.start_check_~tmp~84) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-30 10:55:25,219 INFO L422 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~r1 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 (<= ~r1 1) .cse4 .cse5))) [2018-09-30 10:55:25,244 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:55:25 BoogieIcfgContainer [2018-09-30 10:55:25,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:55:25,245 INFO L168 Benchmark]: Toolchain (without parser) took 9869.56 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 11.5 MB). Peak memory consumption was 489.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:25,249 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-09-30 10:55:25,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.23 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-09-30 10:55:25,254 INFO L168 Benchmark]: Boogie Preprocessor took 32.43 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-09-30 10:55:25,255 INFO L168 Benchmark]: RCFGBuilder took 789.80 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-09-30 10:55:25,256 INFO L168 Benchmark]: TraceAbstraction took 8982.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -20.2 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:25,267 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.21 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 57.23 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 32.43 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 789.80 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 8982.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -20.2 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((0 <= ~send1 && ~r1 == 0) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 1 <= check_~tmp~84) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((0 <= ~send1 && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && ~r1 == 0) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((((0 <= ~send1 && ~r1 == 0) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 204 SDslu, 158 SDs, 0 SdLazy, 169 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 145 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 167 NumberOfFragments, 794 HoareAnnotationTreeSize, 14 FomulaSimplifications, 6469 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 319 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 14141 SizeOfPredicates, 1 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 105/117 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/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-55-25-306.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-55-25-306.csv Received shutdown request...