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-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:04,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:04,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:04,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:04,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:04,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:04,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:04,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:04,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:04,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:04,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:04,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:04,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:04,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:04,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:04,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:04,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:04,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:04,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:04,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:04,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:04,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:04,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:04,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:04,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:04,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:04,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:04,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:04,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:04,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:04,836 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:04,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:04,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:04,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:04,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:04,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:04,839 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:04,856 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:04,856 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:04,857 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:04,857 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:04,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:04,858 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:04,858 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:04,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:04,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:04,860 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:04,860 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:04,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:04,860 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:04,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:04,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:04,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:04,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:04,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:04,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:04,862 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:04,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:04,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:04,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:04,929 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:04,930 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:04,931 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-04 09:21:04,931 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-10-04 09:21:04,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:04,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:04,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:04,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:05,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:05,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:05,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:05,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:05,058 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:05,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/1) ... [2018-10-04 09:21:05,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:05,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:05,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:05,115 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:05,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (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:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:05,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:05,790 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:05,791 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:05 BoogieIcfgContainer [2018-10-04 09:21:05,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:05,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:05,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:05,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:05,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:04" (1/2) ... [2018-10-04 09:21:05,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272551a5 and model type pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:05, skipping insertion in model container [2018-10-04 09:21:05,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:05" (2/2) ... [2018-10-04 09:21:05,800 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-04 09:21:05,810 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:05,818 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:05,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:05,867 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:05,867 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:05,868 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:05,868 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:05,868 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:05,868 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:05,868 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:05,869 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 09:21:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:21:05,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:05,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:05,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:05,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 09:21:05,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:06,140 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:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:06,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:06,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:06,166 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 09:21:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:06,236 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-04 09:21:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:06,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:21:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:06,250 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:21:06,250 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:21:06,254 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:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:21:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-04 09:21:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:21:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-04 09:21:06,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-04 09:21:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:06,300 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-04 09:21:06,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 09:21:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:21:06,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:06,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:06,302 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:06,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-04 09:21:06,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:06,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:06,401 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:06,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:06,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:06,404 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-04 09:21:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:06,459 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-10-04 09:21:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:06,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:21:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:06,462 INFO L225 Difference]: With dead ends: 79 [2018-10-04 09:21:06,462 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:21:06,463 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:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:21:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-04 09:21:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 09:21:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-10-04 09:21:06,479 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-10-04 09:21:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:06,480 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-10-04 09:21:06,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-10-04 09:21:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:21:06,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:06,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:06,481 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:06,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-10-04 09:21:06,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:06,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:06,658 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:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:06,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:06,660 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-10-04 09:21:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:06,867 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-04 09:21:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:06,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 09:21:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:06,881 INFO L225 Difference]: With dead ends: 109 [2018-10-04 09:21:06,882 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 09:21:06,882 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:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 09:21:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-04 09:21:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:21:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-10-04 09:21:06,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-10-04 09:21:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:06,916 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-10-04 09:21:06,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-10-04 09:21:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:21:06,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:06,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:06,920 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:06,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-10-04 09:21:06,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:06,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:06,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:07,037 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:07,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:07,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:07,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:07,040 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-10-04 09:21:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:07,127 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-10-04 09:21:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:07,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:21:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:07,130 INFO L225 Difference]: With dead ends: 143 [2018-10-04 09:21:07,130 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:21:07,133 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:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:21:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 09:21:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 09:21:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-04 09:21:07,161 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-10-04 09:21:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-04 09:21:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-04 09:21:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:21:07,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:07,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:07,166 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:07,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:07,167 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-10-04 09:21:07,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:07,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:07,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:07,357 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-04 09:21:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:07,458 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-10-04 09:21:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:07,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 09:21:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:07,461 INFO L225 Difference]: With dead ends: 249 [2018-10-04 09:21:07,461 INFO L226 Difference]: Without dead ends: 167 [2018-10-04 09:21:07,466 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:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-04 09:21:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-04 09:21:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 09:21:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-10-04 09:21:07,534 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-10-04 09:21:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:07,534 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-10-04 09:21:07,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-10-04 09:21:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:21:07,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:07,537 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:07,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:07,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-10-04 09:21:07,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:07,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:07,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:07,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:07,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:07,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:07,711 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-10-04 09:21:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:07,838 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-10-04 09:21:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:07,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 09:21:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:07,843 INFO L225 Difference]: With dead ends: 489 [2018-10-04 09:21:07,843 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 09:21:07,846 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:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 09:21:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-04 09:21:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-04 09:21:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-10-04 09:21:07,924 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-10-04 09:21:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:07,924 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-10-04 09:21:07,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-10-04 09:21:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:21:07,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:07,931 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:07,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:07,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-10-04 09:21:07,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:08,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:08,178 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:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:08,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:08,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:21:08,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:21:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:21:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:21:08,695 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-10-04 09:21:08,933 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 09:21:09,299 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:21:09,652 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:21:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:10,851 INFO L93 Difference]: Finished difference Result 911 states and 1139 transitions. [2018-10-04 09:21:10,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:21:10,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 09:21:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:10,855 INFO L225 Difference]: With dead ends: 911 [2018-10-04 09:21:10,855 INFO L226 Difference]: Without dead ends: 589 [2018-10-04 09:21:10,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:21:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-04 09:21:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-10-04 09:21:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-04 09:21:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 505 transitions. [2018-10-04 09:21:10,970 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 505 transitions. Word has length 26 [2018-10-04 09:21:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:10,970 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 505 transitions. [2018-10-04 09:21:10,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:21:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 505 transitions. [2018-10-04 09:21:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 09:21:10,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:10,974 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:10,975 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 819979193, now seen corresponding path program 2 times [2018-10-04 09:21:10,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:10,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:10,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-04 09:21:11,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:11,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:11,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:11,144 INFO L87 Difference]: Start difference. First operand 409 states and 505 transitions. Second operand 3 states. [2018-10-04 09:21:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:11,331 INFO L93 Difference]: Finished difference Result 945 states and 1155 transitions. [2018-10-04 09:21:11,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:11,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-04 09:21:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:11,334 INFO L225 Difference]: With dead ends: 945 [2018-10-04 09:21:11,334 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 09:21:11,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 09:21:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 349. [2018-10-04 09:21:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 09:21:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 416 transitions. [2018-10-04 09:21:11,420 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 416 transitions. Word has length 50 [2018-10-04 09:21:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:11,421 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 416 transitions. [2018-10-04 09:21:11,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 416 transitions. [2018-10-04 09:21:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 09:21:11,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:11,423 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 09:21:11,423 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:11,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 3 times [2018-10-04 09:21:11,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:11,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:21:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 09:21:11,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:11,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:11,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:11,497 INFO L87 Difference]: Start difference. First operand 349 states and 416 transitions. Second operand 3 states. [2018-10-04 09:21:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:11,510 INFO L93 Difference]: Finished difference Result 351 states and 418 transitions. [2018-10-04 09:21:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:11,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-04 09:21:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:11,511 INFO L225 Difference]: With dead ends: 351 [2018-10-04 09:21:11,511 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:21:11,512 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:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:21:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:21:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:21:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:21:11,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-10-04 09:21:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:11,513 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:21:11,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:21:11,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:21:11,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:21:11,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:11,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:12,909 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:21:13,187 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:13,537 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:21:13,666 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:14,089 WARN L178 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:21:14,288 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 09:21:14,423 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:14,542 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:14,725 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 385) no Hoare annotation was computed. [2018-10-04 09:21:14,725 INFO L421 ceAbstractionStarter]: At program point L318(lines 312 319) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:14,725 INFO L421 ceAbstractionStarter]: At program point L382(lines 252 382) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:14,726 INFO L421 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:14,726 INFO L421 ceAbstractionStarter]: At program point L298(lines 289 299) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:21:14,726 INFO L421 ceAbstractionStarter]: At program point L259(lines 259 271) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:14,727 INFO L421 ceAbstractionStarter]: At program point L323(lines 323 333) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:14,727 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 384) no Hoare annotation was computed. [2018-10-04 09:21:14,727 INFO L421 ceAbstractionStarter]: At program point L352(lines 352 359) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 09:21:14,727 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 385) no Hoare annotation was computed. [2018-10-04 09:21:14,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 385) no Hoare annotation was computed. [2018-10-04 09:21:14,728 INFO L421 ceAbstractionStarter]: At program point L379(lines 379 383) the Hoare annotation is: false [2018-10-04 09:21:14,728 INFO L421 ceAbstractionStarter]: At program point L280(lines 280 290) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:14,728 INFO L421 ceAbstractionStarter]: At program point L373(lines 373 380) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-04 09:21:14,728 INFO L421 ceAbstractionStarter]: At program point L338(lines 332 339) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:14,729 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:21:14,729 INFO L421 ceAbstractionStarter]: At program point L363(lines 358 364) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:21:14,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,767 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:21:14 BoogieIcfgContainer [2018-10-04 09:21:14,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:21:14,768 INFO L168 Benchmark]: Toolchain (without parser) took 9770.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 88.9 MB). Peak memory consumption was 489.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:14,769 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:21:14,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.85 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:21:14,770 INFO L168 Benchmark]: Boogie Preprocessor took 56.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 09:21:14,771 INFO L168 Benchmark]: RCFGBuilder took 676.69 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:21:14,772 INFO L168 Benchmark]: TraceAbstraction took 8974.78 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 57.2 MB). Peak memory consumption was 458.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:14,776 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 57.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.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 676.69 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 8974.78 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 57.2 MB). Peak memory consumption was 458.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 384]: 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: 303]: Loop Invariant [2018-10-04 09:21:14,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,786 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,787 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,788 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 323]: Loop Invariant [2018-10-04 09:21:14,789 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,789 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,790 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && !(0 == check_~tmp~101)) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 352]: Loop Invariant [2018-10-04 09:21:14,792 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && !(0 == check_~tmp~101)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 289]: Loop Invariant [2018-10-04 09:21:14,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,795 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,796 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,796 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 312]: Loop Invariant [2018-10-04 09:21:14,798 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,798 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,799 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,799 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 332]: Loop Invariant [2018-10-04 09:21:14,800 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,800 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,801 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:14,801 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 197 SDslu, 195 SDs, 0 SdLazy, 164 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 133 NumberOfFragments, 853 HoareAnnotationTreeSize, 13 FomulaSimplifications, 13454 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 8 QuantifiedInterpolants, 23953 SizeOfPredicates, 1 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 178/192 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-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-21-14-808.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-21-14-808.csv Received shutdown request...