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.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:56,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:56,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:56,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:56,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:56,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:56,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:56,214 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:56,216 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:56,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:56,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:56,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:56,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:56,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:56,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:56,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:56,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:56,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:56,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:56,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:56,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:56,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:56,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:56,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:56,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:56,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:56,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:56,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:56,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:56,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:56,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:56,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:56,259 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:56,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:56,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:56,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:56,262 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:56,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:56,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:56,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:56,280 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:56,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:56,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:56,281 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:56,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:56,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:56,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:56,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:56,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:56,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:56,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:56,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:56,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:56,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:56,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:56,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:56,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:56,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:56,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:56,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:56,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:56,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:56,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:56,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:56,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:56,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:56,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:56,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:56,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:56,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:56,359 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:56,360 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:56,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 09:21:56,361 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl' [2018-10-04 09:21:56,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:56,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:56,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:56,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:56,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:56,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:56,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:56,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:56,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:56,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/1) ... [2018-10-04 09:21:56,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:56,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:56,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:56,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:56,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (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:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:56,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:57,342 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:57,343 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:57 BoogieIcfgContainer [2018-10-04 09:21:57,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:57,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:57,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:57,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:57,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:56" (1/2) ... [2018-10-04 09:21:57,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fb5981 and model type pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:57, skipping insertion in model container [2018-10-04 09:21:57,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:57" (2/2) ... [2018-10-04 09:21:57,352 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-04 09:21:57,362 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:57,376 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:57,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:57,438 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:57,438 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:57,438 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:57,438 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:57,438 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:57,439 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:57,439 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:57,439 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-04 09:21:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:57,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,474 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,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-04 09:21:57,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:57,800 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,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:57,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:57,825 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-04 09:21:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,874 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-04 09:21:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:57,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,896 INFO L225 Difference]: With dead ends: 54 [2018-10-04 09:21:57,897 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:21:57,903 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,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:21:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 09:21:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:21:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-04 09:21:57,975 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-04 09:21:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,975 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-04 09:21:57,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-04 09:21:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:57,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,976 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,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-04 09:21:57,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,108 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,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:58,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,114 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-04 09:21:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,179 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-04 09:21:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,183 INFO L225 Difference]: With dead ends: 97 [2018-10-04 09:21:58,183 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:21:58,184 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:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:21:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-04 09:21:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:21:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-04 09:21:58,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-04 09:21:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,224 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-04 09:21:58,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-04 09:21:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:58,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,225 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:58,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-04 09:21:58,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,348 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,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:58,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,351 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-04 09:21:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,389 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-04 09:21:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,394 INFO L225 Difference]: With dead ends: 187 [2018-10-04 09:21:58,394 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 09:21:58,395 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:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 09:21:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-04 09:21:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 09:21:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-04 09:21:58,426 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-04 09:21:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,426 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-04 09:21:58,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-04 09:21:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:58,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,427 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:58,428 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-04 09:21:58,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,573 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,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:58,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:58,576 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-04 09:21:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:58,669 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-04 09:21:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:58,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:58,673 INFO L225 Difference]: With dead ends: 367 [2018-10-04 09:21:58,673 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 09:21:58,675 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:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 09:21:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-04 09:21:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 09:21:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-04 09:21:58,725 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-04 09:21:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:58,726 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-04 09:21:58,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-04 09:21:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:58,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:58,727 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:58,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:58,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-04 09:21:58,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:58,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,932 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,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:58,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:58,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:58,934 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-04 09:21:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:59,228 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-04 09:21:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:59,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:59,233 INFO L225 Difference]: With dead ends: 517 [2018-10-04 09:21:59,233 INFO L226 Difference]: Without dead ends: 515 [2018-10-04 09:21:59,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-04 09:21:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-04 09:21:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 09:21:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-04 09:21:59,299 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-04 09:21:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:59,299 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-04 09:21:59,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-04 09:21:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:59,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:59,300 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:59,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:59,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-04 09:21:59,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:59,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:59,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:59,535 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:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:59,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:59,537 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-04 09:21:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:59,910 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-10-04 09:21:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:21:59,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:59,916 INFO L225 Difference]: With dead ends: 879 [2018-10-04 09:21:59,916 INFO L226 Difference]: Without dead ends: 605 [2018-10-04 09:21:59,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-04 09:22:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-10-04 09:22:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-04 09:22:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-10-04 09:22:00,041 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-10-04 09:22:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:00,041 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-10-04 09:22:00,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:22:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-10-04 09:22:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:22:00,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:00,050 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:22:00,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:00,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-10-04 09:22:00,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:00,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:00,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:00,235 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:22:00,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:00,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:00,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:00,237 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-10-04 09:22:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:00,517 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-10-04 09:22:00,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:00,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-04 09:22:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:00,527 INFO L225 Difference]: With dead ends: 1809 [2018-10-04 09:22:00,527 INFO L226 Difference]: Without dead ends: 1207 [2018-10-04 09:22:00,530 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:22:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-04 09:22:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-10-04 09:22:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 09:22:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-04 09:22:00,742 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-10-04 09:22:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:00,743 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-04 09:22:00,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-04 09:22:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:22:00,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:00,750 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:22:00,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:00,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:00,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-10-04 09:22:00,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:00,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:01,079 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 09:22:01,375 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 09:22:01,390 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:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:01,390 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:22:01,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:01,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:01,993 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 09:22:02,233 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:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 09:22:02,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:22:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:22:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:22:02,272 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 7 states. [2018-10-04 09:22:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:03,633 INFO L93 Difference]: Finished difference Result 1889 states and 2370 transitions. [2018-10-04 09:22:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:22:03,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-10-04 09:22:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:03,641 INFO L225 Difference]: With dead ends: 1889 [2018-10-04 09:22:03,642 INFO L226 Difference]: Without dead ends: 991 [2018-10-04 09:22:03,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-04 09:22:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-10-04 09:22:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 725. [2018-10-04 09:22:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-10-04 09:22:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 892 transitions. [2018-10-04 09:22:03,838 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 892 transitions. Word has length 62 [2018-10-04 09:22:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:03,839 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 892 transitions. [2018-10-04 09:22:03,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:22:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 892 transitions. [2018-10-04 09:22:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 09:22:03,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:03,842 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:03,842 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:03,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1342683145, now seen corresponding path program 2 times [2018-10-04 09:22:03,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:03,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 09:22:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:04,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:04,014 INFO L87 Difference]: Start difference. First operand 725 states and 892 transitions. Second operand 3 states. [2018-10-04 09:22:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:04,056 INFO L93 Difference]: Finished difference Result 749 states and 917 transitions. [2018-10-04 09:22:04,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:04,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-04 09:22:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:04,057 INFO L225 Difference]: With dead ends: 749 [2018-10-04 09:22:04,057 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:04,058 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:22:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:04,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-10-04 09:22:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:04,060 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:04,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:04,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:04,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:04,376 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-04 09:22:04,611 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-04 09:22:04,797 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 09:22:04,942 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 09:22:05,350 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-04 09:22:05,601 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) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,601 INFO L421 ceAbstractionStarter]: At program point L411(lines 407 418) the Hoare annotation is: (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (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)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,601 INFO L421 ceAbstractionStarter]: At program point L279(lines 279 291) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse3) (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (= .cse4 ~p5_old) (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3))) [2018-10-04 09:22:05,602 INFO L421 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (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)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,602 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) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:05,602 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:05,603 INFO L421 ceAbstractionStarter]: At program point L441(lines 272 441) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse3) (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (= .cse4 ~p5_old) (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3))) [2018-10-04 09:22:05,603 INFO L421 ceAbstractionStarter]: At program point L342(lines 334 343) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,603 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-10-04 09:22:05,603 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 357) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,603 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-10-04 09:22:05,603 INFO L421 ceAbstractionStarter]: At program point L364(lines 356 365) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,604 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) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,604 INFO L421 ceAbstractionStarter]: At program point L422(lines 417 423) the Hoare annotation is: (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (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)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,604 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-10-04 09:22:05,604 INFO L421 ceAbstractionStarter]: At program point L402(lines 402 408) the Hoare annotation is: (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (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)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,605 INFO L421 ceAbstractionStarter]: At program point L369(lines 369 379) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,605 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) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-10-04 09:22:05,605 INFO L421 ceAbstractionStarter]: At program point L386(lines 378 387) the Hoare annotation is: (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 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:05,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,619 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,620 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,620 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,624 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,633 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,648 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,648 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,648 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,651 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:05 BoogieIcfgContainer [2018-10-04 09:22:05,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:05,652 INFO L168 Benchmark]: Toolchain (without parser) took 9179.87 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.7 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Peak memory consumption was 191.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:05,654 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:05,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.34 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:05,655 INFO L168 Benchmark]: Boogie Preprocessor took 39.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:05,655 INFO L168 Benchmark]: RCFGBuilder took 771.76 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:05,656 INFO L168 Benchmark]: TraceAbstraction took 8307.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 124.0 MB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:05,660 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.19 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 56.34 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 39.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 771.76 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 8307.77 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 35.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 124.0 MB). Peak memory consumption was 159.6 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) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 272]: Loop Invariant [2018-10-04 09:22:05,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,676 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)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) - InvariantResult [Line: 378]: Loop Invariant [2018-10-04 09:22:05,676 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 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) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 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) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 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) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 09:22:05,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 279]: Loop Invariant [2018-10-04 09:22:05,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,686 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)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 417]: Loop Invariant [2018-10-04 09:22:05,687 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,689 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 407]: Loop Invariant [2018-10-04 09:22:05,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,690 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,692 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,692 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,692 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 432]: Loop Invariant [2018-10-04 09:22:05,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 09:22:05,695 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg <= 1 && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 196 SDslu, 218 SDs, 0 SdLazy, 126 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s 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.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 516 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 708 HoareAnnotationTreeSize, 16 FomulaSimplifications, 879 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 58847 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 416/420 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.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-05-701.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-05-701.csv Received shutdown request...