java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:55:32,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:55:32,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:55:32,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:55:32,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:55:32,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:55:32,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:55:32,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:55:32,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:55:32,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:55:32,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:55:32,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:55:32,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:55:32,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:55:32,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:55:32,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:55:32,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:55:32,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:55:32,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:55:32,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:55:32,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:55:32,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:55:32,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:55:32,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:55:32,206 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:55:32,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:55:32,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:55:32,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:55:32,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:55:32,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:55:32,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:55:32,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:55:32,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:55:32,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:55:32,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:55:32,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:55:32,215 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:55:32,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:55:32,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:55:32,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:55:32,231 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:55:32,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:55:32,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:55:32,232 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:55:32,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:55:32,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:55:32,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:55:32,233 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:55:32,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:55:32,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:55:32,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:55:32,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:55:32,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:55:32,234 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:55:32,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:55:32,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:55:32,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:55:32,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:55:32,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:55:32,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:55:32,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:55:32,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:55:32,236 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:55:32,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:55:32,237 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:55:32,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:55:32,237 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:55:32,237 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:55:32,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:55:32,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:55:32,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:55:32,336 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:55:32,337 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:55:32,338 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.BOUNDED-10.pals.c_21.bpl [2018-09-30 10:55:32,338 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-09-30 10:55:32,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:55:32,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:55:32,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:55:32,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:55:32,422 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:55:32,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:55:32,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:55:32,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:55:32,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:55:32,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... [2018-09-30 10:55:32,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:55:32,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:55:32,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:55:32,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:55:32,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:55:32,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:55:32,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:55:33,312 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:55:33,312 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:55:33 BoogieIcfgContainer [2018-09-30 10:55:33,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:55:33,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:55:33,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:55:33,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:55:33,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:55:32" (1/2) ... [2018-09-30 10:55:33,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c78d800 and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:55:33, skipping insertion in model container [2018-09-30 10:55:33,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:55:33" (2/2) ... [2018-09-30 10:55:33,321 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-09-30 10:55:33,331 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:55:33,341 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:55:33,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:55:33,393 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:55:33,393 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:55:33,393 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:55:33,394 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:55:33,394 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:55:33,394 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:55:33,394 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:55:33,394 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:55:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-30 10:55:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:33,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:33,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:33,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:33,443 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-09-30 10:55:33,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:33,727 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:33,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:33,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:33,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:33,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:33,745 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-30 10:55:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:33,878 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-09-30 10:55:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:33,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 10:55:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:33,891 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:55:33,891 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:55:33,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:55:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-09-30 10:55:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:55:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-09-30 10:55:33,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-09-30 10:55:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:33,942 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-09-30 10:55:33,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-09-30 10:55:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:33,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:33,943 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:33,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:33,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:33,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-09-30 10:55:33,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:33,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:33,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:33,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:33,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:34,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:34,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:34,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:34,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:34,039 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-09-30 10:55:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:34,210 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-09-30 10:55:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:34,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 10:55:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:34,212 INFO L225 Difference]: With dead ends: 97 [2018-09-30 10:55:34,212 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 10:55:34,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 10:55:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-30 10:55:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 10:55:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-09-30 10:55:34,235 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-09-30 10:55:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:34,235 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-09-30 10:55:34,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-09-30 10:55:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:34,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:34,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:34,237 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:34,237 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-09-30 10:55:34,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:34,361 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:34,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:34,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:34,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:34,363 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-09-30 10:55:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:34,464 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-09-30 10:55:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:34,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 10:55:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:34,469 INFO L225 Difference]: With dead ends: 187 [2018-09-30 10:55:34,469 INFO L226 Difference]: Without dead ends: 125 [2018-09-30 10:55:34,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-30 10:55:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-09-30 10:55:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-30 10:55:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-09-30 10:55:34,503 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-09-30 10:55:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:34,504 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-09-30 10:55:34,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-09-30 10:55:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:34,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:34,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:34,506 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:34,506 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-09-30 10:55:34,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:34,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:34,617 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:34,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:34,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:34,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:34,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:34,619 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-09-30 10:55:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:34,787 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-09-30 10:55:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:34,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 10:55:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:34,790 INFO L225 Difference]: With dead ends: 367 [2018-09-30 10:55:34,791 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 10:55:34,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 10:55:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-09-30 10:55:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-30 10:55:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-09-30 10:55:34,853 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-09-30 10:55:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:34,856 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-09-30 10:55:34,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-09-30 10:55:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:34,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:34,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:34,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:34,858 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-09-30 10:55:34,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:35,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:35,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:55:35,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:55:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:55:35,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:35,164 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-09-30 10:55:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:35,742 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-09-30 10:55:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:55:35,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-30 10:55:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:35,750 INFO L225 Difference]: With dead ends: 517 [2018-09-30 10:55:35,750 INFO L226 Difference]: Without dead ends: 515 [2018-09-30 10:55:35,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-30 10:55:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-09-30 10:55:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-30 10:55:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-09-30 10:55:35,820 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-09-30 10:55:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:35,825 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-09-30 10:55:35,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:55:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-09-30 10:55:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:55:35,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:35,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:35,827 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:35,828 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-09-30 10:55:35,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:35,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:35,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:35,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:55:35,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:55:35,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:55:35,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:35,935 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-09-30 10:55:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:36,692 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-09-30 10:55:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:55:36,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-30 10:55:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:36,698 INFO L225 Difference]: With dead ends: 799 [2018-09-30 10:55:36,698 INFO L226 Difference]: Without dead ends: 525 [2018-09-30 10:55:36,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-09-30 10:55:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-09-30 10:55:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 10:55:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-09-30 10:55:36,794 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-09-30 10:55:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:36,795 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-09-30 10:55:36,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:55:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-09-30 10:55:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:55:36,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:36,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:36,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:36,799 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-09-30 10:55:36,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:36,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:55:36,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:36,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:55:36,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:36,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:36,940 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-09-30 10:55:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:37,362 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-09-30 10:55:37,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:37,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-30 10:55:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:37,369 INFO L225 Difference]: With dead ends: 1207 [2018-09-30 10:55:37,369 INFO L226 Difference]: Without dead ends: 805 [2018-09-30 10:55:37,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-09-30 10:55:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-09-30 10:55:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-30 10:55:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-09-30 10:55:37,535 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-09-30 10:55:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:37,536 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-09-30 10:55:37,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-09-30 10:55:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:55:37,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:37,544 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:37,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:37,549 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-09-30 10:55:37,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:37,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:37,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:37,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:37,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:55:37,769 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:55:37,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:55:37,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:37,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:55:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:55:38,664 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:55:38,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-09-30 10:55:38,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:55:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:55:38,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:38,666 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 5 states. [2018-09-30 10:55:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:39,811 INFO L93 Difference]: Finished difference Result 2327 states and 2917 transitions. [2018-09-30 10:55:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:55:39,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-09-30 10:55:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:39,821 INFO L225 Difference]: With dead ends: 2327 [2018-09-30 10:55:39,821 INFO L226 Difference]: Without dead ends: 1525 [2018-09-30 10:55:39,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-09-30 10:55:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1205. [2018-09-30 10:55:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-30 10:55:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-09-30 10:55:40,129 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 32 [2018-09-30 10:55:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:40,129 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-09-30 10:55:40,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:55:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-09-30 10:55:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 10:55:40,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:40,135 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-09-30 10:55:40,135 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:40,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:40,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 2 times [2018-09-30 10:55:40,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:40,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:40,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 10:55:40,636 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:55:40,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:55:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:55:40,761 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:55:40,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:55:40,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:55:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-30 10:55:41,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:55:41,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 10:55:41,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:55:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:55:41,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:41,990 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-09-30 10:55:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:47,706 INFO L93 Difference]: Finished difference Result 2315 states and 2909 transitions. [2018-09-30 10:55:47,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:55:47,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-09-30 10:55:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:47,713 INFO L225 Difference]: With dead ends: 2315 [2018-09-30 10:55:47,714 INFO L226 Difference]: Without dead ends: 1113 [2018-09-30 10:55:47,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-09-30 10:55:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 499. [2018-09-30 10:55:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-09-30 10:55:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2018-09-30 10:55:48,053 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 62 [2018-09-30 10:55:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:48,053 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2018-09-30 10:55:48,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:55:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2018-09-30 10:55:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 10:55:48,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:48,055 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:55:48,055 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:48,055 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash 929696755, now seen corresponding path program 3 times [2018-09-30 10:55:48,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:48,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:48,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:55:48,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 10:55:48,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:48,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:55:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:48,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:48,180 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand 3 states. [2018-09-30 10:55:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:48,257 INFO L93 Difference]: Finished difference Result 531 states and 654 transitions. [2018-09-30 10:55:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:48,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-30 10:55:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:48,258 INFO L225 Difference]: With dead ends: 531 [2018-09-30 10:55:48,258 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:55:48,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:55:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:55:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:55:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:55:48,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-09-30 10:55:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:48,260 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:55:48,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:55:48,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:55:48,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:55:49,285 WARN L178 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 26 [2018-09-30 10:55:49,565 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2018-09-30 10:55:50,126 WARN L178 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-09-30 10:55:50,380 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2018-09-30 10:55:50,948 WARN L178 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2018-09-30 10:55:51,121 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-09-30 10:55:51,584 WARN L178 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2018-09-30 10:55:51,969 WARN L178 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-09-30 10:55:52,100 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-09-30 10:55:52,318 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2018-09-30 10:55:52,476 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2018-09-30 10:55:52,912 WARN L178 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2018-09-30 10:55:53,075 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-09-30 10:55:53,077 INFO L422 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= ~mode2 1) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,078 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~r1))) (or (and .cse0 (not (= ~p1_old ~nomsg)) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 256))) (and (<= .cse1 127) (= ~p4_old .cse1) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-09-30 10:55:53,078 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send4)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1)) (.cse11 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse5 (<= ~r1 0)) (.cse12 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~send1 127)) (.cse9 (<= ~send4 127)) (.cse10 (< 0 (+ (div ~send1 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 .cse4 .cse5 .cse11 .cse6 .cse12 .cse8 .cse9 .cse10) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 1) .cse7 .cse2 .cse8 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10))) [2018-09-30 10:55:53,079 INFO L422 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (and (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,079 INFO L422 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,079 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-09-30 10:55:53,080 INFO L422 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and .cse0 .cse1 (not (= ~p1_old ~nomsg)) (<= ~mode2 1) (<= 1 ~mode2) .cse2 .cse3 (< 0 (+ (div ~send1 256) 1)) .cse4 .cse5))) [2018-09-30 10:55:53,080 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-09-30 10:55:53,080 INFO L422 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= ~mode2 1) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,080 INFO L422 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send4) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (= 0 (+ ~nomsg 1)) (<= 0 ~r1) (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 1 ~mode2) (<= ~send1 127) (<= ~send4 127) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-09-30 10:55:53,080 INFO L422 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,080 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-09-30 10:55:53,081 INFO L422 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and .cse0 .cse1 (not (= ~p1_old ~nomsg)) (<= ~mode2 1) (<= 1 ~mode2) .cse2 .cse3 (< 0 (+ (div ~send1 256) 1)) .cse4 .cse5))) [2018-09-30 10:55:53,081 INFO L422 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,081 INFO L422 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-09-30 10:55:53,081 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-09-30 10:55:53,081 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-09-30 10:55:53,082 INFO L422 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~r1))) (or (and .cse0 (not (= ~p1_old ~nomsg)) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 256))) (and (<= .cse1 127) (= ~p4_old .cse1) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-09-30 10:55:53,082 INFO L422 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send4)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1)) (.cse11 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse5 (<= ~r1 0)) (.cse12 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse8 (<= ~send1 127)) (.cse9 (<= ~send4 127)) (.cse10 (< 0 (+ (div ~send1 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 .cse4 .cse5 .cse11 .cse6 .cse12 .cse8 .cse9 .cse10) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 1) .cse7 .cse2 .cse8 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10))) [2018-09-30 10:55:53,082 INFO L422 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= ~mode2 1) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~106) (<= 0 ~r1)) [2018-09-30 10:55:53,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,120 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:55:53 BoogieIcfgContainer [2018-09-30 10:55:53,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:55:53,121 INFO L168 Benchmark]: Toolchain (without parser) took 20703.48 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 157.3 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 350.7 MB). Peak memory consumption was 508.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:53,123 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:53,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:53,124 INFO L168 Benchmark]: Boogie Preprocessor took 56.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:53,125 INFO L168 Benchmark]: RCFGBuilder took 781.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:53,126 INFO L168 Benchmark]: TraceAbstraction took 19806.86 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 157.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 319.0 MB). Peak memory consumption was 476.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:53,130 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.25 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 51.88 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 56.28 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 781.99 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 19806.86 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 157.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 319.0 MB). Peak memory consumption was 476.3 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: 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: 379]: Loop Invariant Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 357]: Loop Invariant [2018-09-30 10:55:53,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && ((((((((((~r1 <= 0 && !(~p1_old == ~nomsg)) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && ~mode2 <= 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~r1 <= 0) && !(~p1_new == ~nomsg)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) || ((((((((((0 <= ~send4 && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~r1 <= 0) && ~mode5 == 256 * (~mode5 / 256)) && !(~p1_new == ~nomsg)) && ~mode3 == 256 * (~mode3 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~r1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send4) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((~r1 <= 0 && 0 <= ~send4) && !(~p1_old == ~nomsg)) && ~mode2 <= 1) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 370]: Loop Invariant [2018-09-30 10:55:53,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-30 10:55:53,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && ((((((((((~r1 <= 0 && !(~p1_old == ~nomsg)) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && ~mode2 <= 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~106) && 0 <= ~r1 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && ~mode2 <= 1) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: (((((((((((assert_~arg <= 1 && 0 <= ~send4) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~r1 <= 0) && !(~p1_new == ~nomsg)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) || ((((((((((0 <= ~send4 && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~r1 <= 0) && ~mode5 == 256 * (~mode5 / 256)) && !(~p1_new == ~nomsg)) && ~mode3 == 256 * (~mode3 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~r1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send4) && 0 == ~nomsg + 1) && 0 <= ~r1) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((~r1 <= 0 && 0 <= ~send4) && !(~p1_old == ~nomsg)) && ~mode2 <= 1) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 19.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 351 SDslu, 305 SDs, 0 SdLazy, 229 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=8, 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: 1.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1306 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 50 NumberOfFragments, 1164 HoareAnnotationTreeSize, 16 FomulaSimplifications, 6167 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 16 FomulaSimplificationsInter, 7653 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 372 ConstructedInterpolants, 27 QuantifiedInterpolants, 217091 SizeOfPredicates, 5 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 281/315 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.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-55-53-165.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-55-53-165.csv Received shutdown request...