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-d19836b [2018-09-26 21:25:07,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:07,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:07,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:07,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:07,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:07,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:07,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:07,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:07,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:07,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:07,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:07,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:07,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:07,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:07,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:07,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:07,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:07,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:07,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:07,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:07,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:07,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:07,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:07,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:07,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:07,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:07,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:07,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:07,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:07,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:07,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:07,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:07,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:07,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:07,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:07,939 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-09-26 21:25:07,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:07,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:07,956 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:07,956 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:07,957 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:07,957 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:07,957 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:07,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:07,957 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:07,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:07,958 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:07,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:07,958 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:07,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:07,959 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:07,959 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:07,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:07,959 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:07,959 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:07,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:07,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:07,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:07,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:07,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:07,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:07,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:07,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:07,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:07,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:07,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:08,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:08,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:08,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:08,058 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:08,059 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:08,059 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-09-26 21:25:08,060 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-09-26 21:25:08,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:08,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:08,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:08,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:08,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:08,174 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,193 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:08,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:08,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:08,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:08,229 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,229 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,232 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,233 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,256 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,262 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,268 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 26.09 09:25:08" (1/1) ... [2018-09-26 21:25:08,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:08,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:08,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:08,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:08,278 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 26.09 09:25:08" (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-09-26 21:25:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:08,978 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:08,978 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 26.09 09:25:08 BoogieIcfgContainer [2018-09-26 21:25:08,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:08,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:08,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:08,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:08,983 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 26.09 09:25:08" (1/2) ... [2018-09-26 21:25:08,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c376804 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 26.09 09:25:08, skipping insertion in model container [2018-09-26 21:25:08,985 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 26.09 09:25:08" (2/2) ... [2018-09-26 21:25:08,989 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-09-26 21:25:08,998 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:09,007 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:09,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:09,059 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:09,059 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:09,059 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:09,059 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:09,059 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:09,060 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:09,060 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:09,060 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-26 21:25:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:25:09,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:09,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:09,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:09,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-09-26 21:25:09,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:09,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:09,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:09,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:09,345 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-09-26 21:25:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:09,413 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-09-26 21:25:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:09,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:25:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:09,426 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:25:09,426 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 21:25:09,430 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-09-26 21:25:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 21:25:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-09-26 21:25:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:25:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-09-26 21:25:09,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-09-26 21:25:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:09,476 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-09-26 21:25:09,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-09-26 21:25:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:25:09,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:09,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:09,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:09,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-09-26 21:25:09,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:09,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:09,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:09,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:09,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:09,659 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-09-26 21:25:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:09,701 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-09-26 21:25:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:09,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:25:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:09,703 INFO L225 Difference]: With dead ends: 79 [2018-09-26 21:25:09,703 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 21:25:09,704 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-09-26 21:25:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 21:25:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-09-26 21:25:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:25:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-09-26 21:25:09,731 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-09-26 21:25:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:09,732 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-09-26 21:25:09,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-09-26 21:25:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:25:09,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:09,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:09,734 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:09,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-09-26 21:25:09,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:09,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:09,945 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:09,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:09,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:09,946 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-09-26 21:25:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:10,105 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-09-26 21:25:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:10,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-09-26 21:25:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:10,110 INFO L225 Difference]: With dead ends: 109 [2018-09-26 21:25:10,111 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 21:25:10,111 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-09-26 21:25:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 21:25:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-09-26 21:25:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:25:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-09-26 21:25:10,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-09-26 21:25:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:10,137 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-09-26 21:25:10,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-09-26 21:25:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:25:10,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:10,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:10,140 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:10,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-09-26 21:25:10,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:10,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:10,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:10,254 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:10,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:10,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:10,256 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-09-26 21:25:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:10,351 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-09-26 21:25:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:10,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:25:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:10,356 INFO L225 Difference]: With dead ends: 143 [2018-09-26 21:25:10,356 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 21:25:10,357 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-09-26 21:25:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 21:25:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 21:25:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:25:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-09-26 21:25:10,386 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-09-26 21:25:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:10,387 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-09-26 21:25:10,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-09-26 21:25:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:25:10,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:10,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:10,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:10,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-09-26 21:25:10,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:10,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:10,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:10,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:10,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:10,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:10,532 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-09-26 21:25:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:10,595 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-09-26 21:25:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:10,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-26 21:25:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:10,600 INFO L225 Difference]: With dead ends: 249 [2018-09-26 21:25:10,600 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 21:25:10,604 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-09-26 21:25:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 21:25:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-09-26 21:25:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 21:25:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-09-26 21:25:10,667 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-09-26 21:25:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:10,668 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-09-26 21:25:10,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-09-26 21:25:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:25:10,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:10,673 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-09-26 21:25:10,674 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:10,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-09-26 21:25:10,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:10,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:10,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:10,774 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:10,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:10,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:10,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:10,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:10,776 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-09-26 21:25:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:10,877 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-09-26 21:25:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:10,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-26 21:25:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:10,881 INFO L225 Difference]: With dead ends: 489 [2018-09-26 21:25:10,882 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 21:25:10,883 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-09-26 21:25:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 21:25:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-09-26 21:25:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 21:25:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-09-26 21:25:10,953 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-09-26 21:25:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:10,954 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-09-26 21:25:10,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-09-26 21:25:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:25:10,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:10,956 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-09-26 21:25:10,957 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:10,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-09-26 21:25:10,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:11,269 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:11,269 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-09-26 21:25:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:11,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:11,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:11,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:11,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:11,533 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-09-26 21:25:11,767 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:25:12,090 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:13,687 INFO L93 Difference]: Finished difference Result 911 states and 1139 transitions. [2018-09-26 21:25:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:25:13,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-09-26 21:25:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:13,695 INFO L225 Difference]: With dead ends: 911 [2018-09-26 21:25:13,696 INFO L226 Difference]: Without dead ends: 589 [2018-09-26 21:25:13,698 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-09-26 21:25:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-09-26 21:25:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-09-26 21:25:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 21:25:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 505 transitions. [2018-09-26 21:25:13,803 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 505 transitions. Word has length 26 [2018-09-26 21:25:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:13,804 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 505 transitions. [2018-09-26 21:25:13,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 505 transitions. [2018-09-26 21:25:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:25:13,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:13,809 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-09-26 21:25:13,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:13,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash 819979193, now seen corresponding path program 2 times [2018-09-26 21:25:13,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:13,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:13,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:13,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-26 21:25:13,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:13,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:13,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:13,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:13,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:13,910 INFO L87 Difference]: Start difference. First operand 409 states and 505 transitions. Second operand 3 states. [2018-09-26 21:25:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:14,073 INFO L93 Difference]: Finished difference Result 945 states and 1155 transitions. [2018-09-26 21:25:14,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:14,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 21:25:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:14,078 INFO L225 Difference]: With dead ends: 945 [2018-09-26 21:25:14,078 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:25:14,080 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-09-26 21:25:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:25:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 349. [2018-09-26 21:25:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 21:25:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 416 transitions. [2018-09-26 21:25:14,172 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 416 transitions. Word has length 50 [2018-09-26 21:25:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:14,172 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 416 transitions. [2018-09-26 21:25:14,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 416 transitions. [2018-09-26 21:25:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:25:14,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:14,174 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-09-26 21:25:14,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:14,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 3 times [2018-09-26 21:25:14,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:14,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:14,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:14,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-26 21:25:14,253 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:14,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:14,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:14,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:14,255 INFO L87 Difference]: Start difference. First operand 349 states and 416 transitions. Second operand 3 states. [2018-09-26 21:25:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:14,271 INFO L93 Difference]: Finished difference Result 351 states and 418 transitions. [2018-09-26 21:25:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:14,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 21:25:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:14,272 INFO L225 Difference]: With dead ends: 351 [2018-09-26 21:25:14,272 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:14,273 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-09-26 21:25:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:14,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-09-26 21:25:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:14,274 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:14,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:14,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:14,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:14,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:14,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:15,974 WARN L178 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:16,188 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:16,527 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:25:16,690 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:17,038 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:25:17,407 WARN L178 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:17,542 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:17,727 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 385) no Hoare annotation was computed. [2018-09-26 21:25:17,727 INFO L422 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-09-26 21:25:17,728 INFO L422 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-09-26 21:25:17,728 INFO L422 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-09-26 21:25:17,728 INFO L422 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-09-26 21:25:17,728 INFO L422 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-09-26 21:25:17,729 INFO L422 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-09-26 21:25:17,729 INFO L422 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-09-26 21:25:17,729 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 385) no Hoare annotation was computed. [2018-09-26 21:25:17,729 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 385) no Hoare annotation was computed. [2018-09-26 21:25:17,729 INFO L422 ceAbstractionStarter]: At program point L379(lines 379 383) the Hoare annotation is: false [2018-09-26 21:25:17,730 INFO L422 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-09-26 21:25:17,730 INFO L422 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-09-26 21:25:17,730 INFO L422 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-09-26 21:25:17,730 INFO L422 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-09-26 21:25:17,730 INFO L422 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-09-26 21:25:17,731 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 384) no Hoare annotation was computed. [2018-09-26 21:25:17,739 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,740 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,747 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,747 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,749 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,750 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,751 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,755 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,756 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,760 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,760 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,761 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,765 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,768 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,768 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,773 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 26.09 09:25:17 BoogieIcfgContainer [2018-09-26 21:25:17,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:17,775 INFO L168 Benchmark]: Toolchain (without parser) took 9626.54 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 82.2 MB). Peak memory consumption was 489.8 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:17,776 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-26 21:25:17,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.44 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-09-26 21:25:17,777 INFO L168 Benchmark]: Boogie Preprocessor took 62.54 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-09-26 21:25:17,778 INFO L168 Benchmark]: RCFGBuilder took 702.45 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-09-26 21:25:17,779 INFO L168 Benchmark]: TraceAbstraction took 8794.10 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.5 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:17,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.44 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 62.54 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 702.45 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 8794.10 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 50.5 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_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-09-26 21:25:17,794 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,794 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,796 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,796 WARN L389 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-09-26 21:25:17,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,797 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,798 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,799 WARN L389 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-09-26 21:25:17,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,801 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,802 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,802 WARN L389 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-09-26 21:25:17,804 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,806 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,806 WARN L389 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-09-26 21:25:17,808 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,808 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,809 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,810 WARN L389 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-09-26 21:25:17,811 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,811 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,812 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:17,812 WARN L389 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.6s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 197 SDslu, 195 SDs, 0 SdLazy, 164 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s 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.3s HoareSimplificationTime, 13 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s 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-09-26_21-25-17-819.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-09-26_21-25-17-819.csv Received shutdown request...