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.6.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:52:56,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:52:56,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:52:56,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:52:56,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:52:56,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:52:56,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:52:56,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:52:56,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:52:56,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:52:56,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:52:56,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:52:56,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:52:56,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:52:56,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:52:56,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:52:56,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:52:56,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:52:56,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:52:56,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:52:56,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:52:56,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:52:56,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:52:56,206 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:52:56,206 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:52:56,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:52:56,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:52:56,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:52:56,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:52:56,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:52:56,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:52:56,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:52:56,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:52:56,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:52:56,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:52:56,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:52:56,214 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-10-04 12:52:56,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:52:56,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:52:56,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:52:56,229 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:52:56,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:52:56,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:52:56,230 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:52:56,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:52:56,231 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:52:56,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:52:56,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:52:56,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:52:56,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:52:56,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:52:56,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:52:56,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:52:56,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:52:56,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:52:56,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:52:56,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:52:56,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:52:56,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:52:56,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:56,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:52:56,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:52:56,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:52:56,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:52:56,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:52:56,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:52:56,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:52:56,235 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:52:56,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:52:56,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:52:56,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:52:56,320 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:52:56,320 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:52:56,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-10-04 12:52:56,321 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl' [2018-10-04 12:52:56,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:52:56,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:52:56,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:56,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:52:56,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:52:56,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:56,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:52:56,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:52:56,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:52:56,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/1) ... [2018-10-04 12:52:56,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:52:56,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:52:56,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:52:56,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:52:56,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52: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 12:52:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:52:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:52:57,345 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:52:57,346 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:57 BoogieIcfgContainer [2018-10-04 12:52:57,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:52:57,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:52:57,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:52:57,354 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:52:57,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:56" (1/2) ... [2018-10-04 12:52:57,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce08500 and model type pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:57, skipping insertion in model container [2018-10-04 12:52:57,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:57" (2/2) ... [2018-10-04 12:52:57,360 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-10-04 12:52:57,370 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:52:57,378 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:52:57,432 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:52:57,433 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:52:57,433 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:52:57,433 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:52:57,433 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:52:57,434 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:52:57,436 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:52:57,436 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:52:57,437 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:52:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 12:52:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:52:57,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:57,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:57,470 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:57,477 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-10-04 12:52:57,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:57,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:57,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:57,764 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 12:52:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:57,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:57,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:57,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:57,791 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-04 12:52:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:57,872 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-10-04 12:52:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:57,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:52:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:57,897 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:52:57,898 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:52:57,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:52:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-04 12:52:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:52:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-10-04 12:52:57,942 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-10-04 12:52:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:57,942 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-10-04 12:52:57,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-10-04 12:52:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:52:57,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:57,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:57,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:57,944 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-10-04 12:52:57,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:57,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:57,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:58,099 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 12:52:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:58,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:58,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:58,102 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:58,102 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-10-04 12:52:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:58,138 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-10-04 12:52:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:58,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:52:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:58,143 INFO L225 Difference]: With dead ends: 109 [2018-10-04 12:52:58,144 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:52:58,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:52:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-04 12:52:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 12:52:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-10-04 12:52:58,190 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-10-04 12:52:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:58,190 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-10-04 12:52:58,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-10-04 12:52:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:52:58,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:58,193 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:58,193 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:58,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-10-04 12:52:58,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:58,354 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 12:52:58,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:58,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:58,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:58,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:58,356 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-10-04 12:52:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:58,400 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-10-04 12:52:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:58,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:52:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:58,405 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:52:58,405 INFO L226 Difference]: Without dead ends: 141 [2018-10-04 12:52:58,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-04 12:52:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-04 12:52:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-04 12:52:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-10-04 12:52:58,439 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-10-04 12:52:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:58,440 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-10-04 12:52:58,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-10-04 12:52:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:52:58,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:58,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:58,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:58,442 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-10-04 12:52:58,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:58,558 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 12:52:58,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:58,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:58,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:58,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:58,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:58,560 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-10-04 12:52:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:58,717 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-10-04 12:52:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:58,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:52:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:58,723 INFO L225 Difference]: With dead ends: 349 [2018-10-04 12:52:58,726 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 12:52:58,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 12:52:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-04 12:52:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-04 12:52:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-10-04 12:52:58,780 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-10-04 12:52:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-10-04 12:52:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-10-04 12:52:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:52:58,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:58,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:58,783 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:58,783 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-10-04 12:52:58,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:58,905 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 12:52:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:52:58,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:52:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:52:58,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:58,907 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-10-04 12:52:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:59,115 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-10-04 12:52:59,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:52:59,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-04 12:52:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:59,118 INFO L225 Difference]: With dead ends: 377 [2018-10-04 12:52:59,119 INFO L226 Difference]: Without dead ends: 375 [2018-10-04 12:52:59,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:52:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-04 12:52:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-10-04 12:52:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 12:52:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-10-04 12:52:59,217 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-10-04 12:52:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:59,218 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-10-04 12:52:59,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:52:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-10-04 12:52:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:52:59,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:59,222 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:59,222 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:59,222 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:59,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-10-04 12:52:59,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:59,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:59,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:59,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:59,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:59,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:59,391 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-10-04 12:52:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:59,520 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-10-04 12:52:59,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:59,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 12:52:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:59,524 INFO L225 Difference]: With dead ends: 669 [2018-10-04 12:52:59,524 INFO L226 Difference]: Without dead ends: 447 [2018-10-04 12:52:59,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-04 12:52:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-10-04 12:52:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-04 12:52:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-10-04 12:52:59,615 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-10-04 12:52:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:59,616 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-10-04 12:52:59,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-10-04 12:52:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:52:59,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:59,623 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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-10-04 12:52:59,625 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:59,625 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-10-04 12:52:59,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:59,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:59,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:59,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:59,766 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-10-04 12:52:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:59,981 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-10-04 12:52:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:59,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 12:52:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:59,987 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 12:52:59,987 INFO L226 Difference]: Without dead ends: 887 [2018-10-04 12:52:59,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-04 12:53:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-10-04 12:53:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-10-04 12:53:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-10-04 12:53:00,143 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-10-04 12:53:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:00,144 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-10-04 12:53:00,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-10-04 12:53:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:53:00,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:00,147 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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-10-04 12:53:00,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:00,148 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-10-04 12:53:00,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:00,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:00,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:00,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:00,274 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:00,275 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-10-04 12:53:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:00,635 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-10-04 12:53:00,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:00,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 12:53:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:00,646 INFO L225 Difference]: With dead ends: 2649 [2018-10-04 12:53:00,647 INFO L226 Difference]: Without dead ends: 1767 [2018-10-04 12:53:00,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-10-04 12:53:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-10-04 12:53:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-04 12:53:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-10-04 12:53:00,950 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-10-04 12:53:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:00,951 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-10-04 12:53:00,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-10-04 12:53:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:53:00,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:00,955 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, 1, 1, 1, 1] [2018-10-04 12:53:00,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:00,959 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-10-04 12:53:00,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:00,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:01,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:01,310 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 12:53:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:01,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:53:02,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:02,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:53:02,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:53:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:53:02,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,321 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-10-04 12:53:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,880 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-10-04 12:53:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:53:06,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-04 12:53:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,889 INFO L225 Difference]: With dead ends: 4087 [2018-10-04 12:53:06,889 INFO L226 Difference]: Without dead ends: 1617 [2018-10-04 12:53:06,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.0s impTime 16 [2018-10-04 12:53:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-10-04 12:53:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-10-04 12:53:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-10-04 12:53:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-10-04 12:53:07,135 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-10-04 12:53:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,135 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-10-04 12:53:07,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:53:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-10-04 12:53:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 12:53:07,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,139 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,139 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,139 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-10-04 12:53:07,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-04 12:53:07,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:07,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,252 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-10-04 12:53:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,289 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-10-04 12:53:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-04 12:53:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,290 INFO L225 Difference]: With dead ends: 1464 [2018-10-04 12:53:07,290 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:07,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:07,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-10-04 12:53:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:07,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:07,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:07,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:53:08,979 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 12:53:09,212 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-04 12:53:10,386 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:53:11,175 WARN L178 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 12:53:11,311 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:53:11,620 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-04 12:53:11,915 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:53:12,056 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:53:12,169 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:53:12,345 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 12:53:12,612 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-04 12:53:12,806 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 12:53:13,073 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 12:53:13,178 INFO L421 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 12:53:13,178 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,178 INFO L421 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 12:53:13,178 INFO L421 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-10-04 12:53:13,179 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-04 12:53:13,179 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-10-04 12:53:13,179 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-10-04 12:53:13,179 INFO L421 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:53:13,179 INFO L421 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-10-04 12:53:13,179 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-10-04 12:53:13,179 INFO L421 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-10-04 12:53:13,180 INFO L421 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,180 INFO L421 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 12:53:13,180 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-04 12:53:13,180 INFO L421 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 12:53:13,181 INFO L421 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-10-04 12:53:13,181 INFO L421 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,181 INFO L421 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:53:13,181 INFO L421 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-10-04 12:53:13,181 INFO L421 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,182 INFO L421 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,182 INFO L421 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 12:53:13,190 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,191 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,197 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,197 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,200 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,201 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,202 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,203 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,207 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,209 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,209 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,218 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,219 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,220 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,221 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,222 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,222 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,224 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,224 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,227 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,227 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,229 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,229 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,231 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,232 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,234 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,234 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,237 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,237 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,241 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:13 BoogieIcfgContainer [2018-10-04 12:53:13,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:13,242 INFO L168 Benchmark]: Toolchain (without parser) took 16809.52 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 144.7 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -40.5 MB). Peak memory consumption was 608.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:13,244 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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 12:53:13,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.24 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 12:53:13,245 INFO L168 Benchmark]: Boogie Preprocessor took 39.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 12:53:13,245 INFO L168 Benchmark]: RCFGBuilder took 822.20 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:13,246 INFO L168 Benchmark]: TraceAbstraction took 15893.97 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 144.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -93.3 MB). Peak memory consumption was 555.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:13,251 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.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. * Boogie Procedure Inliner took 49.24 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.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. * RCFGBuilder took 822.20 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15893.97 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 144.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -93.3 MB). Peak memory consumption was 555.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_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 480]: Loop Invariant [2018-10-04 12:53:13,261 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,262 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant [2018-10-04 12:53:13,264 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,265 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant [2018-10-04 12:53:13,271 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,271 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 396]: Loop Invariant [2018-10-04 12:53:13,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant [2018-10-04 12:53:13,286 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant [2018-10-04 12:53:13,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant [2018-10-04 12:53:13,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 383]: Loop Invariant [2018-10-04 12:53:13,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant [2018-10-04 12:53:13,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,305 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,305 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:53:13,305 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 15.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1408 HoareAnnotationTreeSize, 18 FomulaSimplifications, 41599 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 334 ConstructedInterpolants, 12 QuantifiedInterpolants, 42481 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 167/187 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.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-13-314.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-13-314.csv Received shutdown request...