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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:09,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:09,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:09,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:09,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:09,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:09,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:09,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:09,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:09,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:09,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:09,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:09,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:09,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:09,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:09,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:09,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:09,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:09,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:09,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:09,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:09,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:09,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:09,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:09,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:09,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:09,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:09,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:09,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:09,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:09,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:09,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:09,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:09,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:09,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:09,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:09,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:55:10,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:10,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:10,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:10,029 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:10,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:10,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:10,031 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:10,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:10,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:10,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:10,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:10,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:10,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:10,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:10,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:10,034 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:10,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:10,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:10,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:10,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:10,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:10,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:10,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:10,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:10,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:10,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:10,038 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:10,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:10,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:10,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:10,039 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:10,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:10,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:10,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:10,116 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:10,117 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:10,117 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.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:55:10,118 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-01 00:55:10,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:10,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:10,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:10,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:10,208 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:10,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:10,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:10,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:10,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:10,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/1) ... [2018-10-01 00:55:10,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:10,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:10,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:10,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:10,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (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-01 00:55:10,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:10,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:11,260 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:11,261 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:11 BoogieIcfgContainer [2018-10-01 00:55:11,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:11,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:11,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:11,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:11,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:10" (1/2) ... [2018-10-01 00:55:11,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ba0685 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:11, skipping insertion in model container [2018-10-01 00:55:11,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:11" (2/2) ... [2018-10-01 00:55:11,269 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-01 00:55:11,280 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:11,294 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:11,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:11,345 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:11,345 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:11,345 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:11,345 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:11,345 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:11,346 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:11,346 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:11,346 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-01 00:55:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:11,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:11,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:11,372 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:11,379 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-01 00:55:11,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:11,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:11,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:11,768 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-01 00:55:11,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:11,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:11,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:11,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:11,789 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-01 00:55:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:11,901 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-01 00:55:11,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:11,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:11,917 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:55:11,917 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:55:11,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:55:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-01 00:55:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:55:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-01 00:55:11,964 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-01 00:55:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:11,964 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-01 00:55:11,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-01 00:55:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:11,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:11,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:11,967 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:11,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-01 00:55:11,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:11,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:11,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:12,120 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-01 00:55:12,121 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:12,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:12,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:12,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:12,124 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-01 00:55:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:12,202 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-01 00:55:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:12,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:12,204 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:55:12,204 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:55:12,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:55:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-01 00:55:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:55:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-01 00:55:12,242 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-01 00:55:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:12,243 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-01 00:55:12,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-01 00:55:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:12,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:12,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:12,244 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:12,245 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-01 00:55:12,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:12,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:12,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:12,409 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-01 00:55:12,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:12,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:12,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:12,411 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-01 00:55:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:12,859 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-01 00:55:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:12,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-01 00:55:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:12,869 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:55:12,869 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:55:12,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:55:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-01 00:55:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:55:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-01 00:55:12,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-01 00:55:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:12,923 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-01 00:55:12,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-01 00:55:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:12,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:12,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:12,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:12,928 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-01 00:55:12,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:12,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:12,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:13,032 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-01 00:55:13,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:13,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:13,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:13,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:13,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:13,033 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-01 00:55:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:13,118 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-01 00:55:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:13,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:13,124 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:55:13,124 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:55:13,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:55:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-01 00:55:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:55:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-01 00:55:13,168 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-01 00:55:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:13,169 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-01 00:55:13,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-01 00:55:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:13,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:13,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:13,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:13,173 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-01 00:55:13,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:13,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:13,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:13,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:13,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:13,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:13,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:13,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:13,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:13,373 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-01 00:55:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:13,662 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-01 00:55:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:13,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:13,666 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:55:13,666 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:55:13,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:55:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-01 00:55:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:55:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-01 00:55:13,737 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-01 00:55:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:13,737 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-01 00:55:13,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-01 00:55:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:13,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:13,742 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:13,743 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:13,744 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-01 00:55:13,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:13,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:13,874 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:13,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:13,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:13,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:13,875 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-01 00:55:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:14,018 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-01 00:55:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:14,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:14,024 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:55:14,024 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:55:14,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:55:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-01 00:55:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:55:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-01 00:55:14,090 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-01 00:55:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:14,091 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-01 00:55:14,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-01 00:55:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:14,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:14,094 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:14,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:14,094 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-01 00:55:14,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:14,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:14,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:14,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:14,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:14,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:14,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:14,223 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-01 00:55:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:14,556 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-01 00:55:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:14,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:14,561 INFO L225 Difference]: With dead ends: 1257 [2018-10-01 00:55:14,562 INFO L226 Difference]: Without dead ends: 839 [2018-10-01 00:55:14,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-01 00:55:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-01 00:55:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-01 00:55:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-01 00:55:14,675 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-01 00:55:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:14,675 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-01 00:55:14,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-01 00:55:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:14,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:14,679 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:14,679 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:14,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-01 00:55:14,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:14,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:14,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:14,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:14,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:14,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:14,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:14,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:14,807 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-01 00:55:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:15,278 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-01 00:55:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:15,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:15,290 INFO L225 Difference]: With dead ends: 2505 [2018-10-01 00:55:15,291 INFO L226 Difference]: Without dead ends: 1671 [2018-10-01 00:55:15,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-01 00:55:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-01 00:55:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-01 00:55:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-01 00:55:15,512 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-01 00:55:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:15,513 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-01 00:55:15,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-01 00:55:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:15,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:15,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:15,517 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:15,517 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-01 00:55:15,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:15,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:15,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:15,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:15,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:15,653 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-01 00:55:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:15,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:55:16,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:16,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-01 00:55:16,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:55:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:55:16,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:16,999 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-01 00:55:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:22,153 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-01 00:55:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:55:22,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-01 00:55:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:22,169 INFO L225 Difference]: With dead ends: 4801 [2018-10-01 00:55:22,170 INFO L226 Difference]: Without dead ends: 3135 [2018-10-01 00:55:22,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:55:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-01 00:55:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-01 00:55:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-01 00:55:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-01 00:55:22,563 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-01 00:55:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:22,563 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-01 00:55:22,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:55:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-01 00:55:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:22,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:22,568 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:55:22,568 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:22,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-01 00:55:22,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:22,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-01 00:55:22,690 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:22,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:22,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:22,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:22,691 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-01 00:55:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:23,172 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-01 00:55:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:23,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:23,188 INFO L225 Difference]: With dead ends: 4873 [2018-10-01 00:55:23,188 INFO L226 Difference]: Without dead ends: 2215 [2018-10-01 00:55:23,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-01 00:55:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-01 00:55:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-01 00:55:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-01 00:55:23,533 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-01 00:55:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:23,534 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-01 00:55:23,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-01 00:55:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:23,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:23,539 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-01 00:55:23,539 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:23,540 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-01 00:55:23,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:23,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:23,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:55:23,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-01 00:55:23,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:23,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:23,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:23,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:23,652 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-01 00:55:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:23,699 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-01 00:55:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:23,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:23,700 INFO L225 Difference]: With dead ends: 1799 [2018-10-01 00:55:23,700 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:55:23,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:55:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:55:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:55:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:55:23,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-01 00:55:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:55:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:55:23,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:55:23,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:55:23,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,930 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-01 00:55:23,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:23,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,235 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-01 00:55:24,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,899 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-01 00:55:24,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:24,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:25,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:26,199 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-01 00:55:27,441 WARN L178 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:27,569 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:27,856 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:28,468 WARN L178 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-01 00:55:28,612 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:28,736 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-01 00:55:28,947 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:29,113 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:29,249 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:29,434 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-01 00:55:29,551 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-01 00:55:29,667 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-01 00:55:29,671 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) 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-01 00:55:29,671 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) 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-01 00:55:29,671 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) 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-01 00:55:29,672 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) 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-01 00:55:29,672 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:29,672 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:29,672 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-01 00:55:29,672 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) 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-01 00:55:29,673 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) 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-01 00:55:29,673 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:55:29,673 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-01 00:55:29,673 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) 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-01 00:55:29,673 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-01 00:55:29,674 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) 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-01 00:55:29,674 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) 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-01 00:55:29,674 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) 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-01 00:55:29,674 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) 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-01 00:55:29,675 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) 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-01 00:55:29,675 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-01 00:55:29,675 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) 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-01 00:55:29,675 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) 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-01 00:55:29,689 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,690 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,696 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,698 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,727 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,729 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,729 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,734 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,734 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,736 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,736 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,742 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:29 BoogieIcfgContainer [2018-10-01 00:55:29,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:29,746 INFO L168 Benchmark]: Toolchain (without parser) took 19542.35 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 191.9 MB). Free memory was 1.4 GB in the beginning and 882.6 MB in the end (delta: 553.1 MB). Peak memory consumption was 745.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:29,747 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:29,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:29,749 INFO L168 Benchmark]: Boogie Preprocessor took 73.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:29,749 INFO L168 Benchmark]: RCFGBuilder took 924.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:29,750 INFO L168 Benchmark]: TraceAbstraction took 18480.82 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 191.9 MB). Free memory was 1.4 GB in the beginning and 882.6 MB in the end (delta: 510.8 MB). Peak memory consumption was 702.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:29,755 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 924.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18480.82 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 191.9 MB). Free memory was 1.4 GB in the beginning and 882.6 MB in the end (delta: 510.8 MB). Peak memory consumption was 702.7 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] - 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: 541]: 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: 382]: 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: 445]: Loop Invariant [2018-10-01 00:55:29,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,767 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,767 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: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-01 00:55:29,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,769 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,770 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,770 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: 485]: Loop Invariant [2018-10-01 00:55:29,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,771 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,772 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,772 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: 416]: Loop Invariant [2018-10-01 00:55:29,773 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,773 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,774 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,774 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: 436]: Loop Invariant [2018-10-01 00:55:29,775 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,776 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,776 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,777 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: 393]: 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: 371]: 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: 456]: Loop Invariant [2018-10-01 00:55:29,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,778 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,779 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,779 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: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-01 00:55:29,781 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,781 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,782 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: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-01 00:55:29,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,783 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,786 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: 364]: 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: 402]: Loop Invariant [2018-10-01 00:55:29,788 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,788 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,809 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,809 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: 425]: Loop Invariant [2018-10-01 00:55:29,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,812 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-01 00:55:29,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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-29-820.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-29-820.csv Received shutdown request...