java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:48:36,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:48:36,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:48:36,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:48:36,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:48:36,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:48:36,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:48:36,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:48:36,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:48:36,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:48:36,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:48:36,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:48:36,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:48:36,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:48:36,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:48:36,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:48:36,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:48:36,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:48:36,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:48:36,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:48:36,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:48:36,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:48:36,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:48:36,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:48:36,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:48:36,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:48:36,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:48:36,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:48:36,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:48:36,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:48:36,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:48:36,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:48:36,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:48:36,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:48:36,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:48:36,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:48:36,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:48:36,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:48:36,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:48:36,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:48:36,755 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:48:36,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:48:36,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:48:36,756 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:48:36,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:48:36,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:48:36,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:48:36,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:48:36,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:48:36,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:48:36,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:48:36,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:48:36,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:48:36,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:48:36,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:48:36,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:48:36,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:48:36,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:48:36,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:48:36,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:48:36,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:48:36,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:48:36,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:48:36,760 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:48:36,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:48:36,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:48:36,761 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:48:36,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:48:36,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:48:36,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:48:36,844 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:48:36,845 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:48:36,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-03 08:48:36,846 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl' [2018-10-03 08:48:36,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:48:36,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:48:36,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:36,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:48:36,949 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:48:36,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:36,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:48:36,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:48:36,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:48:37,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:37,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:48:37,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:48:37,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:48:37,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:48:37,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (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-03 08:48:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:48:37,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:48:37,812 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:48:37,812 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:48:37 BoogieIcfgContainer [2018-10-03 08:48:37,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:48:37,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:48:37,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:48:37,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:48:37,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/2) ... [2018-10-03 08:48:37,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6d42da and model type pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:48:37, skipping insertion in model container [2018-10-03 08:48:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:48:37" (2/2) ... [2018-10-03 08:48:37,821 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-03 08:48:37,831 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:48:37,839 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:48:37,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:48:37,889 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:48:37,889 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:48:37,890 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:48:37,890 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:48:37,890 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:48:37,890 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:48:37,890 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:48:37,891 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:48:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-03 08:48:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:48:37,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:37,917 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:37,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:37,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-03 08:48:37,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:38,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,180 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-03 08:48:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,252 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-03 08:48:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:48:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,266 INFO L225 Difference]: With dead ends: 48 [2018-10-03 08:48:38,267 INFO L226 Difference]: Without dead ends: 31 [2018-10-03 08:48:38,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-03 08:48:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-03 08:48:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 08:48:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-03 08:48:38,314 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-03 08:48:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,315 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-03 08:48:38,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-03 08:48:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:48:38,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-03 08:48:38,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,464 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-03 08:48:38,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,470 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-03 08:48:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,535 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-03 08:48:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:48:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,538 INFO L225 Difference]: With dead ends: 85 [2018-10-03 08:48:38,538 INFO L226 Difference]: Without dead ends: 57 [2018-10-03 08:48:38,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-03 08:48:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-03 08:48:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-03 08:48:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-03 08:48:38,565 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-03 08:48:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,568 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-03 08:48:38,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-03 08:48:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:48:38,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-03 08:48:38,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,681 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-03 08:48:38,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,683 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-03 08:48:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,752 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-03 08:48:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:48:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,757 INFO L225 Difference]: With dead ends: 163 [2018-10-03 08:48:38,757 INFO L226 Difference]: Without dead ends: 109 [2018-10-03 08:48:38,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-03 08:48:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-03 08:48:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-03 08:48:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-03 08:48:38,786 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-03 08:48:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,787 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-03 08:48:38,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-03 08:48:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:48:38,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,789 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-03 08:48:38,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,939 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-03 08:48:38,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,943 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-03 08:48:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:39,068 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-03 08:48:39,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:39,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:48:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:39,071 INFO L225 Difference]: With dead ends: 269 [2018-10-03 08:48:39,071 INFO L226 Difference]: Without dead ends: 163 [2018-10-03 08:48:39,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-03 08:48:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-03 08:48:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-03 08:48:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-03 08:48:39,117 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-03 08:48:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:39,118 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-03 08:48:39,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-03 08:48:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:48:39,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:39,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:39,119 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:39,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-03 08:48:39,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:39,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:39,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:39,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:39,226 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-03 08:48:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:39,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:48:39,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:48:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:48:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:48:39,229 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-03 08:48:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:39,439 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-03 08:48:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:48:39,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-03 08:48:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:39,443 INFO L225 Difference]: With dead ends: 293 [2018-10-03 08:48:39,443 INFO L226 Difference]: Without dead ends: 291 [2018-10-03 08:48:39,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:48:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-03 08:48:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-03 08:48:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-03 08:48:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-03 08:48:39,503 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-03 08:48:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:39,504 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-03 08:48:39,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:48:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-03 08:48:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 08:48:39,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:39,506 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:39,506 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:39,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-03 08:48:39,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:39,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:39,688 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-03 08:48:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:39,806 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-03 08:48:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:39,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-03 08:48:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:39,810 INFO L225 Difference]: With dead ends: 525 [2018-10-03 08:48:39,810 INFO L226 Difference]: Without dead ends: 351 [2018-10-03 08:48:39,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-03 08:48:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-03 08:48:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-03 08:48:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-03 08:48:39,904 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-03 08:48:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:39,904 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-03 08:48:39,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-03 08:48:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 08:48:39,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:39,908 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:39,909 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:39,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-03 08:48:39,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:39,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:40,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:48:40,095 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-03 08:48:40,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:40,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:48:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 08:48:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:48:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-03 08:48:40,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:48:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:48:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:48:40,469 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-10-03 08:48:40,657 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-03 08:48:41,297 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-03 08:48:41,663 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-03 08:48:42,291 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-03 08:48:43,434 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-03 08:48:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:44,018 INFO L93 Difference]: Finished difference Result 827 states and 1068 transitions. [2018-10-03 08:48:44,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 08:48:44,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-03 08:48:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:44,028 INFO L225 Difference]: With dead ends: 827 [2018-10-03 08:48:44,028 INFO L226 Difference]: Without dead ends: 481 [2018-10-03 08:48:44,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:48:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-10-03 08:48:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 307. [2018-10-03 08:48:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-03 08:48:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2018-10-03 08:48:44,110 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 28 [2018-10-03 08:48:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:44,110 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2018-10-03 08:48:44,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:48:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2018-10-03 08:48:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-03 08:48:44,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:44,115 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:44,115 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:44,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2104861015, now seen corresponding path program 2 times [2018-10-03 08:48:44,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:44,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:44,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-03 08:48:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:44,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:44,294 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand 3 states. [2018-10-03 08:48:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:44,329 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2018-10-03 08:48:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:44,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-03 08:48:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:44,335 INFO L225 Difference]: With dead ends: 357 [2018-10-03 08:48:44,335 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:48:44,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:48:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:48:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:48:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:48:44,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-03 08:48:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:44,337 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:48:44,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:48:44,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:48:44,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:48:44,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:44,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:45,829 WARN L178 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-03 08:48:46,652 WARN L178 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-03 08:48:46,941 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-03 08:48:47,105 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-03 08:48:48,578 WARN L178 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-03 08:48:49,216 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-03 08:48:49,219 INFO L421 ceAbstractionStarter]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-03 08:48:49,219 INFO L421 ceAbstractionStarter]: At program point L349(lines 344 350) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:49,220 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 370) no Hoare annotation was computed. [2018-10-03 08:48:49,220 INFO L421 ceAbstractionStarter]: At program point L271(lines 263 272) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-03 08:48:49,220 INFO L421 ceAbstractionStarter]: At program point L329(lines 329 335) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:49,220 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 371) no Hoare annotation was computed. [2018-10-03 08:48:49,220 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 371) no Hoare annotation was computed. [2018-10-03 08:48:49,220 INFO L421 ceAbstractionStarter]: At program point L276(lines 276 286) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-03 08:48:49,220 INFO L421 ceAbstractionStarter]: At program point L338(lines 334 345) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:49,221 INFO L421 ceAbstractionStarter]: At program point L231(lines 231 242) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:49,221 INFO L421 ceAbstractionStarter]: At program point L359(lines 359 366) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:49,221 INFO L421 ceAbstractionStarter]: At program point L293(lines 285 294) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-10-03 08:48:49,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 371) no Hoare annotation was computed. [2018-10-03 08:48:49,221 INFO L421 ceAbstractionStarter]: At program point L368(lines 224 368) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:49,222 INFO L421 ceAbstractionStarter]: At program point L298(lines 298 309) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-10-03 08:48:49,222 INFO L421 ceAbstractionStarter]: At program point L315(lines 308 316) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-03 08:48:49,222 INFO L421 ceAbstractionStarter]: At program point L249(lines 241 250) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-10-03 08:48:49,222 INFO L421 ceAbstractionStarter]: At program point L365(lines 365 369) the Hoare annotation is: false [2018-10-03 08:48:49,232 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,233 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,240 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,241 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,244 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,245 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,245 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,245 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,249 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,249 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,250 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,250 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,253 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,254 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,256 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,256 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,258 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,258 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,260 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,260 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,263 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,264 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,267 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,267 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,267 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,268 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,271 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,275 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:48:49 BoogieIcfgContainer [2018-10-03 08:48:49,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:48:49,277 INFO L168 Benchmark]: Toolchain (without parser) took 12331.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.5 MB). Peak memory consumption was 489.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:49,278 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:49,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:49,279 INFO L168 Benchmark]: Boogie Preprocessor took 60.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:49,280 INFO L168 Benchmark]: RCFGBuilder took 753.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:49,281 INFO L168 Benchmark]: TraceAbstraction took 11462.35 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.2 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:49,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 753.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11462.35 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 46.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.2 MB). Peak memory consumption was 458.0 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: 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: 263]: Loop Invariant [2018-10-03 08:48:49,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,312 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 285]: Loop Invariant [2018-10-03 08:48:49,314 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,314 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,316 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 254]: Loop Invariant [2018-10-03 08:48:49,328 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,328 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,332 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,333 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 276]: Loop Invariant [2018-10-03 08:48:49,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,335 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,335 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 298]: Loop Invariant [2018-10-03 08:48:49,339 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode4 && ~send3 <= 127) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 241]: Loop Invariant [2018-10-03 08:48:49,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,350 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-03 08:48:49,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 11.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 179 SDslu, 174 SDs, 0 SdLazy, 208 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 72 NumberOfFragments, 1161 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5056 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 439 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 8 QuantifiedInterpolants, 21881 SizeOfPredicates, 1 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 101/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-48-49-359.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-48-49-359.csv Received shutdown request...