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/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:39:08,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:39:08,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:39:08,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:39:08,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:39:08,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:39:08,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:39:08,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:39:08,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:39:08,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:39:08,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:39:08,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:39:08,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:39:08,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:39:08,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:39:08,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:39:08,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:39:08,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:39:08,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:39:08,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:39:08,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:39:08,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:39:08,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:39:08,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:39:08,088 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:39:08,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:39:08,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:39:08,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:39:08,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:39:08,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:39:08,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:39:08,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:39:08,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:39:08,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:39:08,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:39:08,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:39:08,099 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:39:08,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:39:08,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:39:08,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:39:08,115 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:39:08,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:39:08,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:39:08,115 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:39:08,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:39:08,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:39:08,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:39:08,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:39:08,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:39:08,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:39:08,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:39:08,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:39:08,117 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:39:08,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:39:08,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:39:08,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:39:08,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:39:08,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:39:08,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:39:08,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:08,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:39:08,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:39:08,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:39:08,119 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:39:08,120 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:39:08,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:39:08,120 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:39:08,120 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:39:08,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:39:08,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:39:08,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:39:08,193 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:39:08,193 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:39:08,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl [2018-10-01 00:39:08,194 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl' [2018-10-01 00:39:08,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:39:08,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:39:08,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:08,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:39:08,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:39:08,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:08,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:39:08,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:39:08,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:39:08,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... [2018-10-01 00:39:08,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:39:08,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:39:08,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:39:08,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:39:08,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:08,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:39:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:39:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:39:09,006 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:39:09,006 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:09 BoogieIcfgContainer [2018-10-01 00:39:09,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:39:09,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:39:09,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:39:09,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:39:09,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:08" (1/2) ... [2018-10-01 00:39:09,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66651278 and model type pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:39:09, skipping insertion in model container [2018-10-01 00:39:09,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:09" (2/2) ... [2018-10-01 00:39:09,014 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl [2018-10-01 00:39:09,022 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:39:09,030 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:39:09,072 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:39:09,073 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:39:09,073 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:39:09,073 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:39:09,073 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:39:09,074 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:39:09,074 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:39:09,074 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:39:09,074 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:39:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-01 00:39:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash 738430141, now seen corresponding path program 1 times [2018-10-01 00:39:09,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,316 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:39:09,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:09,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:09,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,338 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-01 00:39:09,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,430 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-01 00:39:09,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:09,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,452 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:39:09,452 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:39:09,458 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:39:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:39:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-01 00:39:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-01 00:39:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-10-01 00:39:09,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 15 [2018-10-01 00:39:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,499 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-10-01 00:39:09,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-10-01 00:39:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,501 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,501 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 151624127, now seen corresponding path program 1 times [2018-10-01 00:39:09,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,590 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:39:09,591 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:09,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:09,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,593 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 3 states. [2018-10-01 00:39:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,645 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-01 00:39:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:09,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,647 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:39:09,647 INFO L226 Difference]: Without dead ends: 20 [2018-10-01 00:39:09,648 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:39:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-01 00:39:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-01 00:39:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-01 00:39:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-01 00:39:09,654 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2018-10-01 00:39:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-01 00:39:09,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-01 00:39:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,656 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash -549440451, now seen corresponding path program 1 times [2018-10-01 00:39:09,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,744 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:39:09,744 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:09,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:09,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,746 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-01 00:39:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,830 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2018-10-01 00:39:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:09,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:39:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,832 INFO L225 Difference]: With dead ends: 50 [2018-10-01 00:39:09,832 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:39:09,832 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:39:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:39:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-01 00:39:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:39:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-10-01 00:39:09,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 15 [2018-10-01 00:39:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,842 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-10-01 00:39:09,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2018-10-01 00:39:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:09,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:09,844 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,844 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash 130617919, now seen corresponding path program 1 times [2018-10-01 00:39:09,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,947 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:39:09,948 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:09,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:09,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:09,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:09,949 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2018-10-01 00:39:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:10,237 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-10-01 00:39:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:10,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:39:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:10,243 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:39:10,243 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:39:10,244 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:39:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:39:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2018-10-01 00:39:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:39:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-10-01 00:39:10,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 15 [2018-10-01 00:39:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-10-01 00:39:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-10-01 00:39:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:10,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:10,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:10,270 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:10,270 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 130677501, now seen corresponding path program 1 times [2018-10-01 00:39:10,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:10,412 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:39:10,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:10,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:10,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:10,414 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 4 states. [2018-10-01 00:39:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:10,559 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2018-10-01 00:39:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:10,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:39:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:10,566 INFO L225 Difference]: With dead ends: 80 [2018-10-01 00:39:10,566 INFO L226 Difference]: Without dead ends: 78 [2018-10-01 00:39:10,567 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:39:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-01 00:39:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. [2018-10-01 00:39:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:39:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-10-01 00:39:10,581 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 15 [2018-10-01 00:39:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:10,582 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-10-01 00:39:10,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-10-01 00:39:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:39:10,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:10,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:10,583 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:10,583 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash 187876221, now seen corresponding path program 1 times [2018-10-01 00:39:10,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:10,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:10,669 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:39:10,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:10,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:39:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:10,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:10,670 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 4 states. [2018-10-01 00:39:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:10,986 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2018-10-01 00:39:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:39:10,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:39:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:10,989 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:39:10,989 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:39:10,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:39:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-01 00:39:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:39:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-10-01 00:39:11,011 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 15 [2018-10-01 00:39:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:11,012 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-10-01 00:39:11,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-10-01 00:39:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:39:11,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:11,014 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:11,014 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:11,015 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -152842755, now seen corresponding path program 1 times [2018-10-01 00:39:11,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:11,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:11,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:11,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:11,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:39:11,144 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:11,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:39:11,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:11,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:11,145 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 4 states. [2018-10-01 00:39:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:12,049 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2018-10-01 00:39:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:12,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-01 00:39:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:12,052 INFO L225 Difference]: With dead ends: 152 [2018-10-01 00:39:12,052 INFO L226 Difference]: Without dead ends: 94 [2018-10-01 00:39:12,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-01 00:39:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-10-01 00:39:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:39:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-10-01 00:39:12,077 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2018-10-01 00:39:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:12,078 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-10-01 00:39:12,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-10-01 00:39:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-01 00:39:12,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:12,080 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:39:12,080 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:12,081 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash -443020421, now seen corresponding path program 2 times [2018-10-01 00:39:12,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-01 00:39:12,166 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:12,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:39:12,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:12,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:12,168 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 3 states. [2018-10-01 00:39:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:12,203 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-10-01 00:39:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:12,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-10-01 00:39:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:12,205 INFO L225 Difference]: With dead ends: 100 [2018-10-01 00:39:12,205 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:39:12,206 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:39:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:39:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:39:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:39:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:39:12,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-01 00:39:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:12,208 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:39:12,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:39:12,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:39:12,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:39:12,795 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 41 305) no Hoare annotation was computed. [2018-10-01 00:39:12,795 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 305) no Hoare annotation was computed. [2018-10-01 00:39:12,796 INFO L422 ceAbstractionStarter]: At program point L218(lines 211 219) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:12,796 INFO L422 ceAbstractionStarter]: At program point L280(lines 280 287) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= 1 ULTIMATE.start_main_~c1~73) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~63)) [2018-10-01 00:39:12,796 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 41 305) no Hoare annotation was computed. [2018-10-01 00:39:12,796 INFO L422 ceAbstractionStarter]: At program point L223(lines 223 233) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:12,797 INFO L422 ceAbstractionStarter]: At program point L273(lines 268 274) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~63)) [2018-10-01 00:39:12,797 INFO L422 ceAbstractionStarter]: At program point L174(lines 174 187) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 (<= 512 ~mode1) (<= (+ ~mode2 256) 0) (= ~mode3 0)))) [2018-10-01 00:39:12,797 INFO L422 ceAbstractionStarter]: At program point L302(lines 302 303) the Hoare annotation is: false [2018-10-01 00:39:12,798 INFO L422 ceAbstractionStarter]: At program point L294(lines 294 300) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-01 00:39:12,798 INFO L422 ceAbstractionStarter]: At program point L195(lines 186 196) the Hoare annotation is: (and (<= ~r1 0) (<= (+ ~mode2 256) 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:12,798 INFO L422 ceAbstractionStarter]: At program point L290(lines 286 291) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-01 00:39:12,798 INFO L422 ceAbstractionStarter]: At program point L253(lines 253 259) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1)) [2018-10-01 00:39:12,799 INFO L422 ceAbstractionStarter]: At program point L241(lines 232 242) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (not (= ~nomsg ~p3_new))) [2018-10-01 00:39:12,799 INFO L422 ceAbstractionStarter]: At program point L299(lines 169 299) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 (<= 512 ~mode1) (<= (+ ~mode2 256) 0) (= ~mode3 0)))) [2018-10-01 00:39:12,799 INFO L422 ceAbstractionStarter]: At program point L200(lines 200 212) the Hoare annotation is: (and (<= ~r1 0) (<= (+ ~mode2 256) 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-01 00:39:12,799 INFO L422 ceAbstractionStarter]: At program point L262(lines 258 269) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1)) [2018-10-01 00:39:12,799 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 304) no Hoare annotation was computed. [2018-10-01 00:39:12,814 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:39:12 BoogieIcfgContainer [2018-10-01 00:39:12,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:39:12,816 INFO L168 Benchmark]: Toolchain (without parser) took 4553.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:12,818 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:12,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:12,820 INFO L168 Benchmark]: Boogie Preprocessor took 29.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:12,821 INFO L168 Benchmark]: RCFGBuilder took 666.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:12,822 INFO L168 Benchmark]: TraceAbstraction took 3807.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 158.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:12,828 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 666.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3807.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 158.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 304]: 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: 211]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && !(~nomsg == ~p3_new) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= check_~tmp~63 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 + 256 <= 0) && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 512 <= ~mode1) && ~mode2 + 256 <= 0) && ~mode3 == 0) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_#in~arg - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && 1 <= main_~c1~73) && ~mode1 <= 1) && 1 <= check_~tmp~63 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 + 256 <= 0) && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 512 <= ~mode1) && ~mode2 + 256 <= 0) && ~mode3 == 0) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 142 SDslu, 197 SDs, 0 SdLazy, 82 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 29 NumberOfFragments, 206 HoareAnnotationTreeSize, 14 FomulaSimplifications, 202 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 10796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 169/169 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-39-12-845.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-39-12-845.csv Received shutdown request...