java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:53,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:53,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:53,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:53,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:53,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:53,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:53,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:53,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:53,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:53,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:53,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:53,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:53,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:53,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:53,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:53,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:53,782 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:53,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:53,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:53,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:53,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:53,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:53,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:53,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:53,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:53,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:53,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:53,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:53,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:53,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:53,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:53,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:53,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:53,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:53,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:53,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:21:53,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:53,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:53,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:53,832 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:53,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:53,836 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:53,837 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:53,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:53,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:53,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:53,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:53,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:53,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:53,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:53,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:53,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:53,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:53,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:53,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:53,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:53,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:53,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:53,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:53,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:53,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:53,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:53,843 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:53,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:53,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:53,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:53,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:53,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:53,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:53,925 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:53,926 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:53,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-04 09:21:53,927 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl' [2018-10-04 09:21:54,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:54,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:54,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:54,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:54,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:54,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:54,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:54,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:54,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:54,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... [2018-10-04 09:21:54,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:54,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:54,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:54,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:54,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:54,852 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:54,853 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:54 BoogieIcfgContainer [2018-10-04 09:21:54,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:54,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:54,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:54,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:54,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:53" (1/2) ... [2018-10-04 09:21:54,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd76d7d and model type pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:54, skipping insertion in model container [2018-10-04 09:21:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:54" (2/2) ... [2018-10-04 09:21:54,860 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-04 09:21:54,870 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:54,878 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:54,927 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:54,927 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:54,928 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:54,928 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:54,928 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:54,928 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:54,928 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:54,928 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:54,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-04 09:21:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:54,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:54,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:54,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:54,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-04 09:21:54,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:54,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:55,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,243 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-04 09:21:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:55,316 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-04 09:21:55,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:55,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:55,329 INFO L225 Difference]: With dead ends: 54 [2018-10-04 09:21:55,329 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:21:55,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:21:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 09:21:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:21:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-04 09:21:55,378 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-04 09:21:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:55,378 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-04 09:21:55,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-04 09:21:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:55,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:55,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:55,380 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:55,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-04 09:21:55,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:55,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:55,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:55,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:55,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:55,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,527 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-04 09:21:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:55,586 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-04 09:21:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:55,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:55,588 INFO L225 Difference]: With dead ends: 97 [2018-10-04 09:21:55,588 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:21:55,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:21:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-04 09:21:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:21:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-04 09:21:55,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-04 09:21:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:55,610 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-04 09:21:55,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-04 09:21:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:55,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:55,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:55,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:55,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-04 09:21:55,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:55,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:55,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:55,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:55,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,732 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-04 09:21:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:55,811 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-04 09:21:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:55,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:55,818 INFO L225 Difference]: With dead ends: 187 [2018-10-04 09:21:55,819 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 09:21:55,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 09:21:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-04 09:21:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 09:21:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-04 09:21:55,890 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-04 09:21:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:55,891 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-04 09:21:55,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-04 09:21:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:55,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:55,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:55,893 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:55,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-04 09:21:55,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:55,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:56,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:56,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:56,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:56,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:56,052 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-04 09:21:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:56,133 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-04 09:21:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:56,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:21:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:56,138 INFO L225 Difference]: With dead ends: 367 [2018-10-04 09:21:56,139 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 09:21:56,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 09:21:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-04 09:21:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 09:21:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-04 09:21:56,197 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-04 09:21:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:56,198 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-04 09:21:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-04 09:21:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:56,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:56,200 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:56,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:56,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-04 09:21:56,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:56,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:56,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:56,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:56,343 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-04 09:21:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:56,569 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-04 09:21:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:56,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:56,574 INFO L225 Difference]: With dead ends: 517 [2018-10-04 09:21:56,574 INFO L226 Difference]: Without dead ends: 515 [2018-10-04 09:21:56,575 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-04 09:21:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-04 09:21:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-04 09:21:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 09:21:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-04 09:21:56,637 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-04 09:21:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:56,637 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-04 09:21:56,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-04 09:21:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:21:56,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:56,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:56,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:56,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-04 09:21:56,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:56,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:56,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:56,876 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-04 09:21:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,209 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-10-04 09:21:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:21:57,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 09:21:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,214 INFO L225 Difference]: With dead ends: 799 [2018-10-04 09:21:57,214 INFO L226 Difference]: Without dead ends: 525 [2018-10-04 09:21:57,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-04 09:21:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-10-04 09:21:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 09:21:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-10-04 09:21:57,295 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-10-04 09:21:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,295 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-10-04 09:21:57,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-10-04 09:21:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:21:57,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,298 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:57,299 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-10-04 09:21:57,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:57,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:57,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:57,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:57,452 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-10-04 09:21:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:57,667 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-10-04 09:21:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:57,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-04 09:21:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:57,673 INFO L225 Difference]: With dead ends: 1207 [2018-10-04 09:21:57,673 INFO L226 Difference]: Without dead ends: 805 [2018-10-04 09:21:57,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-10-04 09:21:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-10-04 09:21:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-10-04 09:21:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-10-04 09:21:57,827 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-10-04 09:21:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:57,828 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-10-04 09:21:57,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-10-04 09:21:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:21:57,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:57,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:57,832 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:57,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-10-04 09:21:57,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:57,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,013 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-04 09:21:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:58,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:58,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:21:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:58,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:58,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:58,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:21:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:21:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:21:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:21:58,656 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 7 states. [2018-10-04 09:22:01,088 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 09:22:01,421 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 09:22:01,742 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 09:22:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:02,279 INFO L93 Difference]: Finished difference Result 2054 states and 2576 transitions. [2018-10-04 09:22:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:22:02,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-04 09:22:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:02,285 INFO L225 Difference]: With dead ends: 2054 [2018-10-04 09:22:02,285 INFO L226 Difference]: Without dead ends: 845 [2018-10-04 09:22:02,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:22:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-10-04 09:22:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 618. [2018-10-04 09:22:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-04 09:22:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 738 transitions. [2018-10-04 09:22:02,446 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 738 transitions. Word has length 32 [2018-10-04 09:22:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:02,447 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 738 transitions. [2018-10-04 09:22:02,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:22:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 738 transitions. [2018-10-04 09:22:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:22:02,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:02,449 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:22:02,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:02,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 126939387, now seen corresponding path program 2 times [2018-10-04 09:22:02,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:02,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-04 09:22:02,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:02,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:02,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:02,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:02,541 INFO L87 Difference]: Start difference. First operand 618 states and 738 transitions. Second operand 3 states. [2018-10-04 09:22:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:02,556 INFO L93 Difference]: Finished difference Result 624 states and 744 transitions. [2018-10-04 09:22:02,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:02,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-04 09:22:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:02,557 INFO L225 Difference]: With dead ends: 624 [2018-10-04 09:22:02,557 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:02,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:02,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-10-04 09:22:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:02,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:02,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:02,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:02,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:02,733 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 53 [2018-10-04 09:22:04,376 WARN L178 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-04 09:22:04,835 WARN L178 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-04 09:22:05,258 WARN L178 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-10-04 09:22:05,411 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-10-04 09:22:05,607 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-10-04 09:22:05,730 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-04 09:22:05,851 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-04 09:22:06,087 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 22 [2018-10-04 09:22:06,286 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-10-04 09:22:06,521 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2018-10-04 09:22:06,662 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-10-04 09:22:06,838 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-10-04 09:22:06,931 INFO L421 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:06,931 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:06,931 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:06,932 INFO L421 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:06,932 INFO L421 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-04 09:22:06,932 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-10-04 09:22:06,932 INFO L421 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (= ~r1 0) .cse0 .cse1 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256)))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2))) [2018-10-04 09:22:06,932 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-10-04 09:22:06,933 INFO L421 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:06,933 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-10-04 09:22:06,933 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~107) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:06,933 INFO L421 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-04 09:22:06,933 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-10-04 09:22:06,934 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (= ~r1 0) .cse0 .cse1 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256)))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2))) [2018-10-04 09:22:06,934 INFO L421 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (let ((.cse5 (<= 1 ~mode4)) (.cse6 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (<= ~r1 4) .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 (= ~mode3 (* 256 (div ~mode3 256))) .cse6 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-04 09:22:06,934 INFO L421 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (let ((.cse5 (<= 1 ~mode4)) (.cse6 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (<= ~r1 4) .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 (= ~mode3 (* 256 (div ~mode3 256))) .cse6 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-04 09:22:06,934 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-10-04 09:22:06,934 INFO L421 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:06,935 INFO L421 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-04 09:22:06,935 INFO L421 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 09:22:06,958 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:06 BoogieIcfgContainer [2018-10-04 09:22:06,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:06,959 INFO L168 Benchmark]: Toolchain (without parser) took 12951.83 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 369.9 MB). Peak memory consumption was 409.2 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,960 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,961 INFO L168 Benchmark]: Boogie Preprocessor took 37.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:06,962 INFO L168 Benchmark]: RCFGBuilder took 757.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,963 INFO L168 Benchmark]: TraceAbstraction took 12104.69 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 377.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:06,967 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.74 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 37.84 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 757.24 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 12104.69 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 377.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && ~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((((assert_~arg <= 1 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~107) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && ~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 262 SDslu, 240 SDs, 0 SdLazy, 213 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 599 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 431 NumberOfFragments, 926 HoareAnnotationTreeSize, 16 FomulaSimplifications, 28218 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2190 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 21815 SizeOfPredicates, 1 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 117/135 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-06-987.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-06-987.csv Received shutdown request...