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.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:28:13,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:28:13,344 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:28:13,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:28:13,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:28:13,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:28:13,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:28:13,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:28:13,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:28:13,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:28:13,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:28:13,364 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:28:13,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:28:13,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:28:13,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:28:13,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:28:13,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:28:13,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:28:13,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:28:13,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:28:13,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:28:13,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:28:13,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:28:13,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:28:13,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:28:13,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:28:13,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:28:13,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:28:13,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:28:13,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:28:13,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:28:13,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:28:13,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:28:13,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:28:13,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:28:13,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:28:13,389 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:28:13,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:28:13,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:28:13,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:28:13,405 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:28:13,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:28:13,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:28:13,406 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:28:13,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:28:13,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:28:13,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:28:13,408 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:28:13,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:28:13,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:28:13,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:28:13,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:28:13,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:28:13,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:28:13,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:13,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:28:13,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:28:13,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:28:13,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:28:13,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:28:13,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:28:13,410 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:28:13,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:28:13,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:28:13,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:28:13,496 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:28:13,497 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:28:13,498 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:28:13,498 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:28:13,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:28:13,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:28:13,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:13,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:28:13,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:28:13,630 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:28:13" (1/1) ... [2018-09-30 10:28:13,650 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:28:13" (1/1) ... [2018-09-30 10:28:13,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:13,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:28:13,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:28:13,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:28:13,684 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:28:13" (1/1) ... [2018-09-30 10:28:13,684 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:28:13" (1/1) ... [2018-09-30 10:28:13,689 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:28:13" (1/1) ... [2018-09-30 10:28:13,690 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:28:13" (1/1) ... [2018-09-30 10:28:13,709 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:28:13" (1/1) ... [2018-09-30 10:28:13,715 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:28:13" (1/1) ... [2018-09-30 10:28:13,719 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:28:13" (1/1) ... [2018-09-30 10:28:13,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:28:13,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:28:13,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:28:13,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:28:13,728 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:28:13" (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:28:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:28:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:28:14,407 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:28:14,408 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:28:14 BoogieIcfgContainer [2018-09-30 10:28:14,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:28:14,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:28:14,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:28:14,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:28:14,414 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:28:13" (1/2) ... [2018-09-30 10:28:14,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625676a2 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:28:14, skipping insertion in model container [2018-09-30 10:28:14,415 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:28:14" (2/2) ... [2018-09-30 10:28:14,422 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-30 10:28:14,434 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:28:14,445 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:28:14,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:28:14,494 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:28:14,495 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:28:14,495 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:28:14,495 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:28:14,495 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:28:14,495 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:28:14,495 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:28:14,496 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:28:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-30 10:28:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:14,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:14,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:14,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:14,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-30 10:28:14,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:14,752 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:28:14,757 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:14,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:14,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:14,778 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-30 10:28:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:14,856 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-30 10:28:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:14,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:14,874 INFO L225 Difference]: With dead ends: 48 [2018-09-30 10:28:14,875 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:28:14,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:28:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-30 10:28:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:28:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-30 10:28:14,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-30 10:28:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:14,921 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-30 10:28:14,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-30 10:28:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:14,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:14,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:14,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:14,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-30 10:28:14,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:14,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,087 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:28:15,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:15,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:15,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,091 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-30 10:28:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:15,151 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-30 10:28:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:15,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:15,153 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:28:15,154 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:28:15,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:28:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-30 10:28:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 10:28:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-30 10:28:15,173 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-30 10:28:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:15,173 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-30 10:28:15,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-30 10:28:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:15,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:15,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:15,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:15,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-30 10:28:15,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:15,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,297 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:28:15,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:15,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:15,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,300 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-30 10:28:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:15,353 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-30 10:28:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:15,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:15,358 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:28:15,358 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:28:15,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:28:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-30 10:28:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 10:28:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-30 10:28:15,420 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-30 10:28:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:15,420 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-30 10:28:15,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-30 10:28:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:15,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:15,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:15,422 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:15,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-30 10:28:15,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:15,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,533 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:28:15,533 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:15,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:15,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,535 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-30 10:28:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:15,634 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-30 10:28:15,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:15,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:15,637 INFO L225 Difference]: With dead ends: 269 [2018-09-30 10:28:15,637 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 10:28:15,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 10:28:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-30 10:28:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 10:28:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-30 10:28:15,670 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-30 10:28:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:15,671 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-30 10:28:15,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-30 10:28:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:15,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:15,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:15,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:15,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-30 10:28:15,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:15,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:15,816 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:28:15,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:15,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:28:15,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:15,818 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-30 10:28:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:15,997 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-30 10:28:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:28:15,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-30 10:28:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:16,001 INFO L225 Difference]: With dead ends: 293 [2018-09-30 10:28:16,001 INFO L226 Difference]: Without dead ends: 291 [2018-09-30 10:28:16,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:28:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-30 10:28:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-30 10:28:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 10:28:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-30 10:28:16,051 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-30 10:28:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:16,052 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-30 10:28:16,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-30 10:28:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:28:16,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:16,054 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:28:16,054 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:16,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-30 10:28:16,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:16,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:16,200 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:28:16,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:16,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:16,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:16,202 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-30 10:28:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:16,307 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-30 10:28:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:16,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-30 10:28:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:16,313 INFO L225 Difference]: With dead ends: 525 [2018-09-30 10:28:16,313 INFO L226 Difference]: Without dead ends: 351 [2018-09-30 10:28:16,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-30 10:28:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-30 10:28:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-30 10:28:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-30 10:28:16,410 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-30 10:28:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:16,410 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-30 10:28:16,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-30 10:28:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:28:16,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:16,417 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:28:16,417 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:16,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-30 10:28:16,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:16,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:16,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:16,786 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:28:16,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:16,787 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:28:16,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:16,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:17,227 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:28:17,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:17,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:28:17,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:28:17,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:28:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:28:17,259 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-09-30 10:28:17,920 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-30 10:28:18,252 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-30 10:28:18,812 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 10:28:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:19,904 INFO L93 Difference]: Finished difference Result 767 states and 986 transitions. [2018-09-30 10:28:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:28:19,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-09-30 10:28:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:19,908 INFO L225 Difference]: With dead ends: 767 [2018-09-30 10:28:19,908 INFO L226 Difference]: Without dead ends: 272 [2018-09-30 10:28:19,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:28:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-30 10:28:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2018-09-30 10:28:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-30 10:28:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2018-09-30 10:28:19,955 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 28 [2018-09-30 10:28:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2018-09-30 10:28:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:28:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2018-09-30 10:28:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 10:28:19,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:19,959 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:28:19,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:19,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1903869193, now seen corresponding path program 2 times [2018-09-30 10:28:19,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:19,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:20,046 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:28:20,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:20,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:20,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:20,048 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand 3 states. [2018-09-30 10:28:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:20,059 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-09-30 10:28:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:20,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-09-30 10:28:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:20,060 INFO L225 Difference]: With dead ends: 251 [2018-09-30 10:28:20,060 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:20,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:20,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-30 10:28:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:20,062 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:20,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:20,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:20,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:21,079 WARN L178 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-09-30 10:28:21,263 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-09-30 10:28:21,386 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-09-30 10:28:21,552 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-09-30 10:28:21,656 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-09-30 10:28:21,907 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-09-30 10:28:22,368 WARN L178 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-09-30 10:28:22,474 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-09-30 10:28:22,810 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-09-30 10:28:22,815 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:28:22,815 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:28:22,815 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:28:22,815 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:28:22,816 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:28:22,816 INFO L422 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-09-30 10:28:22,816 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-09-30 10:28:22,816 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:28:22,816 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:28:22,816 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:28:22,817 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:28:22,817 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:28:22,817 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:28:22,817 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:28:22,817 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-09-30 10:28:22,818 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:28:22,818 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:28:22,818 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:28:22,841 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:28:22 BoogieIcfgContainer [2018-09-30 10:28:22,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:22,842 INFO L168 Benchmark]: Toolchain (without parser) took 9238.14 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.5 GB in the end (delta: -46.7 MB). Peak memory consumption was 489.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:22,843 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:28:22,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.59 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:28:22,844 INFO L168 Benchmark]: Boogie Preprocessor took 55.13 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:28:22,845 INFO L168 Benchmark]: RCFGBuilder took 681.66 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:22,846 INFO L168 Benchmark]: TraceAbstraction took 8431.79 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.5 GB in the end (delta: -89.0 MB). Peak memory consumption was 447.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:22,850 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 63.59 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 55.13 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 681.66 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8431.79 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.5 GB in the end (delta: -89.0 MB). Peak memory consumption was 447.1 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.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 204 SDslu, 158 SDs, 0 SdLazy, 169 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s 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.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 319 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-22-874.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-22-874.csv Received shutdown request...