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.3.ufo.UNBOUNDED.pals.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:29,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:29,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:29,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:29,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:29,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:29,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:29,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:29,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:29,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:29,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:29,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:29,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:29,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:29,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:29,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:29,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:29,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:29,999 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:30,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:30,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:30,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:30,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:30,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:30,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:30,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:30,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:30,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:30,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:30,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:30,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:30,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:30,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:30,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:30,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:30,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:30,024 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:27:30,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:30,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:30,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:30,049 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:30,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:30,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:30,050 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:30,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:30,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:30,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:30,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:30,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:30,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:30,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:30,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:30,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:30,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:30,052 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:30,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:30,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:30,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:30,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:30,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:30,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:30,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:30,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:30,054 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:30,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:30,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:30,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:30,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:30,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:30,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:30,142 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:30,142 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:30,143 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl [2018-10-04 12:27:30,143 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl' [2018-10-04 12:27:30,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:30,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:30,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:30,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:30,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:30,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:30,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:30,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:30,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:30,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/1) ... [2018-10-04 12:27:30,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:30,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:30,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:30,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:30,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (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:27:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:30,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:30,890 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:30,891 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:30 BoogieIcfgContainer [2018-10-04 12:27:30,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:30,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:30,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:30,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:30,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:30" (1/2) ... [2018-10-04 12:27:30,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4e4fb2 and model type pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:30, skipping insertion in model container [2018-10-04 12:27:30,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:30" (2/2) ... [2018-10-04 12:27:30,902 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl [2018-10-04 12:27:30,911 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:30,924 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:30,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:30,981 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:30,981 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:30,981 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:30,982 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:30,982 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:30,982 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:30,982 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:30,982 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-04 12:27:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:27:31,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:31,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:31,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:31,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:31,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247609, now seen corresponding path program 1 times [2018-10-04 12:27:31,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:31,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:31,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:31,303 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:27:31,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:31,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:31,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:31,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:31,331 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-04 12:27:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:31,401 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-10-04 12:27:31,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:31,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 12:27:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:31,416 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:27:31,416 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:27:31,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:27:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-04 12:27:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:27:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-10-04 12:27:31,485 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-10-04 12:27:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:31,485 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-10-04 12:27:31,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-10-04 12:27:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:27:31,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:31,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:31,487 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:31,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712325, now seen corresponding path program 1 times [2018-10-04 12:27:31,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:31,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:31,690 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:27:31,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:31,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:31,694 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-10-04 12:27:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:31,815 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-10-04 12:27:31,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:31,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-04 12:27:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:31,818 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:27:31,818 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:27:31,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:27:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:27:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-10-04 12:27:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:27:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-04 12:27:31,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-10-04 12:27:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:31,840 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-04 12:27:31,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-04 12:27:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:27:31,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:31,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:31,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:31,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652743, now seen corresponding path program 1 times [2018-10-04 12:27:31,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:31,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:31,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:32,016 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:27:32,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:32,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:32,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:32,018 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-10-04 12:27:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:32,224 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-10-04 12:27:32,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:27:32,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-04 12:27:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:32,228 INFO L225 Difference]: With dead ends: 97 [2018-10-04 12:27:32,228 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:27:32,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:27:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 12:27:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:27:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2018-10-04 12:27:32,275 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 13 [2018-10-04 12:27:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:32,276 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-10-04 12:27:32,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2018-10-04 12:27:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:27:32,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:32,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:32,281 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:32,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash 90659497, now seen corresponding path program 1 times [2018-10-04 12:27:32,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:27:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:32,405 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 3 states. [2018-10-04 12:27:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:32,479 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-10-04 12:27:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:32,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 12:27:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:32,482 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:27:32,482 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 12:27:32,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 12:27:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 12:27:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 12:27:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2018-10-04 12:27:32,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 24 [2018-10-04 12:27:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:32,526 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2018-10-04 12:27:32,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-10-04 12:27:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:27:32,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:32,531 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:32,531 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:32,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash -726110997, now seen corresponding path program 1 times [2018-10-04 12:27:32,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:32,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:32,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 12:27:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:32,677 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand 3 states. [2018-10-04 12:27:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:32,759 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2018-10-04 12:27:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:32,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-04 12:27:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:32,766 INFO L225 Difference]: With dead ends: 339 [2018-10-04 12:27:32,766 INFO L226 Difference]: Without dead ends: 227 [2018-10-04 12:27:32,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-04 12:27:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-04 12:27:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 12:27:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-10-04 12:27:32,828 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 46 [2018-10-04 12:27:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:32,829 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-10-04 12:27:32,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-10-04 12:27:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:27:32,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:32,832 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:32,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2107769241, now seen corresponding path program 1 times [2018-10-04 12:27:32,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:33,186 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 12:27:33,392 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-04 12:27:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 12:27:33,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:33,412 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:27:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:33,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 12:27:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-10-04 12:27:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:27:34,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:27:34,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:27:34,381 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 10 states. [2018-10-04 12:27:35,250 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 12:27:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:37,081 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2018-10-04 12:27:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:27:37,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-10-04 12:27:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:37,083 INFO L225 Difference]: With dead ends: 541 [2018-10-04 12:27:37,084 INFO L226 Difference]: Without dead ends: 196 [2018-10-04 12:27:37,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:27:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-04 12:27:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-10-04 12:27:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 12:27:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-10-04 12:27:37,125 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 46 [2018-10-04 12:27:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:37,126 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-10-04 12:27:37,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:27:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-10-04 12:27:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:27:37,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:37,128 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 12:27:37,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:37,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 702690737, now seen corresponding path program 2 times [2018-10-04 12:27:37,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-04 12:27:37,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:37,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:37,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:37,212 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 3 states. [2018-10-04 12:27:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:37,218 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-10-04 12:27:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:37,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 12:27:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:37,219 INFO L225 Difference]: With dead ends: 157 [2018-10-04 12:27:37,219 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:37,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:37,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-10-04 12:27:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:37,222 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:37,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:37,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:38,571 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-04 12:27:39,055 WARN L178 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-04 12:27:39,203 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-04 12:27:39,307 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-04 12:27:39,431 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-04 12:27:39,645 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 12:27:39,845 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-04 12:27:39,889 INFO L421 ceAbstractionStarter]: At program point L225(lines 217 226) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-04 12:27:39,890 INFO L421 ceAbstractionStarter]: At program point L289(lines 289 295) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~63) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:39,890 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 301) no Hoare annotation was computed. [2018-10-04 12:27:39,890 INFO L421 ceAbstractionStarter]: At program point L184(lines 184 195) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 12:27:39,890 INFO L421 ceAbstractionStarter]: At program point L279(lines 274 280) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~63) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:39,891 INFO L421 ceAbstractionStarter]: At program point L203(lines 194 204) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-10-04 12:27:39,891 INFO L421 ceAbstractionStarter]: At program point L298(lines 298 299) the Hoare annotation is: false [2018-10-04 12:27:39,891 INFO L421 ceAbstractionStarter]: At program point L230(lines 230 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-04 12:27:39,891 INFO L421 ceAbstractionStarter]: At program point L294(lines 177 294) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 12:27:39,891 INFO L421 ceAbstractionStarter]: At program point L259(lines 259 265) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:39,891 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 301) no Hoare annotation was computed. [2018-10-04 12:27:39,891 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 301) no Hoare annotation was computed. [2018-10-04 12:27:39,892 INFO L421 ceAbstractionStarter]: At program point L247(lines 239 248) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-04 12:27:39,892 INFO L421 ceAbstractionStarter]: At program point L208(lines 208 218) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-10-04 12:27:39,892 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 300) no Hoare annotation was computed. [2018-10-04 12:27:39,892 INFO L421 ceAbstractionStarter]: At program point L268(lines 264 275) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:39,914 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:27:39 BoogieIcfgContainer [2018-10-04 12:27:39,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:39,915 INFO L168 Benchmark]: Toolchain (without parser) took 9689.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.7 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -50.0 MB). Peak memory consumption was 489.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:39,916 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:27:39,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.61 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:27:39,917 INFO L168 Benchmark]: Boogie Preprocessor took 30.62 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:27:39,918 INFO L168 Benchmark]: RCFGBuilder took 589.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:39,919 INFO L168 Benchmark]: TraceAbstraction took 9022.03 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.7 MB). Peak memory consumption was 457.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:39,923 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.18 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 43.61 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 30.62 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 589.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9022.03 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -81.7 MB). Peak memory consumption was 457.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 300]: 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: 298]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~63) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~63) && 0 == ~nomsg + 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 204 SDslu, 174 SDs, 0 SdLazy, 406 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 139 NumberOfFragments, 755 HoareAnnotationTreeSize, 12 FomulaSimplifications, 5961 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 28 QuantifiedInterpolants, 50606 SizeOfPredicates, 7 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 326/374 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.3.ufo.UNBOUNDED.pals.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-27-39-945.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-27-39-945.csv Received shutdown request...