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.5.1.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:54,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:54,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:54,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:54,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:54,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:54,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:54,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:54,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:54,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:54,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:54,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:54,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:54,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:54,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:54,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:54,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:55,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:55,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:55,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:55,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:55,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:55,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:55,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:55,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:55,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:55,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:55,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:55,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:55,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:55,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:55,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:55,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:55,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:55,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:55,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:55,028 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-10-04 09:21:55,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:55,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:55,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:55,061 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:55,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:55,061 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:55,065 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:55,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:55,066 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:55,066 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:55,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:55,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:55,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:55,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:55,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:55,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:55,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:55,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:55,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:55,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:55,068 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:55,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:55,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:55,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:55,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:55,069 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:55,069 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:55,070 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:55,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:55,070 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:55,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:55,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:55,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:55,152 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:55,153 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:55,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 09:21:55,154 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl' [2018-10-04 09:21:55,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:55,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:55,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:55,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:55,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:55,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:55,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:55,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:55,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:55,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... [2018-10-04 09:21:55,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:55,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:55,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:55,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:55,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:55,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:56,130 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:56,131 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:56 BoogieIcfgContainer [2018-10-04 09:21:56,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:56,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:56,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:56,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:56,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:55" (1/2) ... [2018-10-04 09:21:56,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc451cc and model type pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:56, skipping insertion in model container [2018-10-04 09:21:56,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:56" (2/2) ... [2018-10-04 09:21:56,139 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 09:21:56,150 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:56,159 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:56,205 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:56,206 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:56,206 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:56,206 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:56,206 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:56,206 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:56,207 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:56,207 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:56,207 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-04 09:21:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:56,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:56,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:56,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:56,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-04 09:21:56,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:56,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:56,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:56,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:56,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:56,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:56,502 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-04 09:21:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:56,567 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-04 09:21:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:56,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:56,581 INFO L225 Difference]: With dead ends: 54 [2018-10-04 09:21:56,581 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:21:56,585 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-10-04 09:21:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:21:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 09:21:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:21:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-04 09:21:56,645 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-04 09:21:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:56,646 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-04 09:21:56,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-04 09:21:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:56,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:56,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:56,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:56,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-04 09:21:56,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:56,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:56,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:56,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:56,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:56,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:56,769 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-04 09:21:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:56,801 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-04 09:21:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:56,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:56,804 INFO L225 Difference]: With dead ends: 97 [2018-10-04 09:21:56,804 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:21:56,805 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-10-04 09:21:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:21:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-04 09:21:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:21:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-04 09:21:56,842 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-04 09:21:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:56,843 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-04 09:21:56,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-04 09:21:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:56,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:56,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:56,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:56,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-04 09:21:56,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:56,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:56,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:57,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:57,005 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-04 09:21:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,060 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-04 09:21:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:57,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,065 INFO L225 Difference]: With dead ends: 187 [2018-10-04 09:21:57,065 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 09:21:57,066 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-10-04 09:21:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 09:21:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-04 09:21:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 09:21:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-04 09:21:57,116 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-04 09:21:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,117 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-04 09:21:57,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-04 09:21:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:57,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:57,119 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-04 09:21:57,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:57,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:57,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:57,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:57,259 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-04 09:21:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,369 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-04 09:21:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:57,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,373 INFO L225 Difference]: With dead ends: 367 [2018-10-04 09:21:57,373 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 09:21:57,375 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-10-04 09:21:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 09:21:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-04 09:21:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 09:21:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-04 09:21:57,423 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-04 09:21:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,423 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-04 09:21:57,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-04 09:21:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:57,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:57,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-04 09:21:57,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:57,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:57,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:57,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:57,623 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-04 09:21:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,867 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-04 09:21:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:57,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,873 INFO L225 Difference]: With dead ends: 517 [2018-10-04 09:21:57,873 INFO L226 Difference]: Without dead ends: 515 [2018-10-04 09:21:57,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-04 09:21:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-04 09:21:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 09:21:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-04 09:21:57,958 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-04 09:21:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,958 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-04 09:21:57,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-04 09:21:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:57,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:57,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-04 09:21:57,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:58,074 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-04 09:21:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,386 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-10-04 09:21:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:21:58,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,392 INFO L225 Difference]: With dead ends: 879 [2018-10-04 09:21:58,392 INFO L226 Difference]: Without dead ends: 605 [2018-10-04 09:21:58,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-04 09:21:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-10-04 09:21:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-04 09:21:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-10-04 09:21:58,498 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-10-04 09:21:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,498 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-10-04 09:21:58,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-10-04 09:21:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:21:58,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,507 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:58,508 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-10-04 09:21:58,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-04 09:21:58,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:58,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,662 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-10-04 09:21:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,939 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-10-04 09:21:58,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-04 09:21:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,946 INFO L225 Difference]: With dead ends: 1809 [2018-10-04 09:21:58,947 INFO L226 Difference]: Without dead ends: 1207 [2018-10-04 09:21:58,949 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-10-04 09:21:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-04 09:21:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-10-04 09:21:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 09:21:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-04 09:21:59,168 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-10-04 09:21:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:59,168 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-04 09:21:59,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-04 09:21:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:21:59,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:59,180 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:59,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:59,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-10-04 09:21:59,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:59,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:59,904 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 09:21:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 09:21:59,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:59,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:21:59,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:00,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:00,638 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 09:22:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-04 09:22:00,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:00,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:22:00,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:22:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:22:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:22:00,949 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-10-04 09:22:01,622 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-04 09:22:02,119 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-10-04 09:22:02,528 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-10-04 09:22:03,506 WARN L178 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-04 09:22:03,828 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-04 09:22:04,686 WARN L178 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-10-04 09:22:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:04,869 INFO L93 Difference]: Finished difference Result 2293 states and 2844 transitions. [2018-10-04 09:22:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:22:04,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-04 09:22:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:04,876 INFO L225 Difference]: With dead ends: 2293 [2018-10-04 09:22:04,876 INFO L226 Difference]: Without dead ends: 1091 [2018-10-04 09:22:04,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-10-04 09:22:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2018-10-04 09:22:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 653. [2018-10-04 09:22:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-10-04 09:22:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 808 transitions. [2018-10-04 09:22:05,076 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 808 transitions. Word has length 62 [2018-10-04 09:22:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:05,077 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 808 transitions. [2018-10-04 09:22:05,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:22:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 808 transitions. [2018-10-04 09:22:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 09:22:05,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:05,079 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:22:05,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:05,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-10-04 09:22:05,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:05,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:05,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:05,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-04 09:22:05,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:05,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:05,197 INFO L87 Difference]: Start difference. First operand 653 states and 808 transitions. Second operand 3 states. [2018-10-04 09:22:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:05,375 INFO L93 Difference]: Finished difference Result 1109 states and 1359 transitions. [2018-10-04 09:22:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-04 09:22:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:05,378 INFO L225 Difference]: With dead ends: 1109 [2018-10-04 09:22:05,378 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 09:22:05,380 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-10-04 09:22:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 09:22:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2018-10-04 09:22:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-04 09:22:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 540 transitions. [2018-10-04 09:22:05,504 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 540 transitions. Word has length 77 [2018-10-04 09:22:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:05,505 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 540 transitions. [2018-10-04 09:22:05,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 540 transitions. [2018-10-04 09:22:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 09:22:05,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:05,506 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:22:05,507 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:05,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1096614215, now seen corresponding path program 3 times [2018-10-04 09:22:05,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:05,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:05,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-04 09:22:05,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:05,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:05,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:05,680 INFO L87 Difference]: Start difference. First operand 457 states and 540 transitions. Second operand 3 states. [2018-10-04 09:22:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:05,707 INFO L93 Difference]: Finished difference Result 464 states and 547 transitions. [2018-10-04 09:22:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:05,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-04 09:22:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:05,708 INFO L225 Difference]: With dead ends: 464 [2018-10-04 09:22:05,708 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:05,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:05,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-10-04 09:22:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:05,711 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:05,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:05,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:05,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:06,413 INFO L421 ceAbstractionStarter]: At program point L320(lines 313 321) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,413 INFO L421 ceAbstractionStarter]: At program point L411(lines 407 418) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= ~send5 127)) [2018-10-04 09:22:06,413 INFO L421 ceAbstractionStarter]: At program point L279(lines 279 291) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and (<= 1 ~mode4) .cse0 (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) .cse3 .cse4 (not (= ~p4_old ~nomsg)) .cse5))) [2018-10-04 09:22:06,414 INFO L421 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~108) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (<= ~send5 127)) [2018-10-04 09:22:06,414 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-10-04 09:22:06,414 INFO L421 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,414 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:06,414 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:06,415 INFO L421 ceAbstractionStarter]: At program point L441(lines 272 441) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and (<= 1 ~mode4) .cse0 (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) .cse3 .cse4 (not (= ~p4_old ~nomsg)) .cse5))) [2018-10-04 09:22:06,415 INFO L421 ceAbstractionStarter]: At program point L342(lines 334 343) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,415 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:06,415 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 357) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,415 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-10-04 09:22:06,416 INFO L421 ceAbstractionStarter]: At program point L364(lines 356 365) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 1 ~mode4) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:06,416 INFO L421 ceAbstractionStarter]: At program point L298(lines 290 299) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,416 INFO L421 ceAbstractionStarter]: At program point L422(lines 417 423) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~108) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (<= ~send5 127)) [2018-10-04 09:22:06,417 INFO L421 ceAbstractionStarter]: At program point L402(lines 402 408) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= ~send5 127)) [2018-10-04 09:22:06,417 INFO L421 ceAbstractionStarter]: At program point L369(lines 369 379) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 1 ~mode4) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:06,417 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-10-04 09:22:06,417 INFO L421 ceAbstractionStarter]: At program point L386(lines 378 387) the Hoare annotation is: (and (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= ~mode1 1) (<= 0 ~send4) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p5_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~send5 127)) [2018-10-04 09:22:06,432 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,437 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,449 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,459 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,462 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,490 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:06 BoogieIcfgContainer [2018-10-04 09:22:06,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:06,491 INFO L168 Benchmark]: Toolchain (without parser) took 11255.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 364.8 MB). Peak memory consumption was 409.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,492 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,493 INFO L168 Benchmark]: Boogie Preprocessor took 52.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,494 INFO L168 Benchmark]: RCFGBuilder took 779.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,494 INFO L168 Benchmark]: TraceAbstraction took 10357.69 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 333.1 MB). Peak memory consumption was 377.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,506 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.20 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 61.26 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 52.66 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 779.78 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 10357.69 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 333.1 MB). Peak memory consumption was 377.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: 303]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 272]: Loop Invariant [2018-10-04 09:22:06,521 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,521 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,522 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,522 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,523 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,523 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,523 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,523 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127) || (((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 378]: Loop Invariant [2018-10-04 09:22:06,524 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,524 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,524 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,525 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,525 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,525 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,526 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,526 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 1 <= ~mode1) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && ~mode1 <= 1) && 0 <= ~send4) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode4) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 09:22:06,528 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127 - InvariantResult [Line: 279]: Loop Invariant [2018-10-04 09:22:06,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127) || (((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode4) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 417]: Loop Invariant [2018-10-04 09:22:06,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~108) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && ~send5 <= 127 - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 407]: Loop Invariant [2018-10-04 09:22:06,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127 - InvariantResult [Line: 432]: Loop Invariant [2018-10-04 09:22:06,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:06,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((1 <= ~mode4 && assert_~arg == 1) && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~108) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && ~send5 <= 127 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 10.2s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 304 SDslu, 256 SDs, 0 SdLazy, 185 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 690 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 33 NumberOfFragments, 953 HoareAnnotationTreeSize, 16 FomulaSimplifications, 314 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 446 ConstructedInterpolants, 7 QuantifiedInterpolants, 72550 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 633/645 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.5.1.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-06-549.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-06-549.csv Received shutdown request...