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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:24:23,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:24:23,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:24:23,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:24:23,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:24:23,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:24:23,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:24:23,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:24:23,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:24:23,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:24:23,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:24:23,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:24:23,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:24:23,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:24:23,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:24:23,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:24:23,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:24:23,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:24:23,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:24:23,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:24:23,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:24:23,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:24:23,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:24:23,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:24:23,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:24:23,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:24:23,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:24:23,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:24:23,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:24:23,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:24:23,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:24:23,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:24:23,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:24:23,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:24:23,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:24:23,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:24:23,231 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-04 14:24:23,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:24:23,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:24:23,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:24:23,258 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:24:23,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:24:23,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:24:23,259 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:24:23,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:24:23,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:24:23,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:24:23,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:24:23,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:24:23,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:24:23,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:24:23,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:24:23,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:24:23,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:24:23,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:24:23,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:24:23,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:24:23,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:24:23,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:24:23,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:23,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:24:23,263 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:24:23,264 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:24:23,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:24:23,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:24:23,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:24:23,325 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:24:23,325 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:24:23,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:24:23,326 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-10-04 14:24:23,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:24:23,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:24:23,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:23,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:24:23,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:24:23,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:23,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:24:23,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:24:23,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:24:23,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... [2018-10-04 14:24:23,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:24:23,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:24:23,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:24:23,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:24:23,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:23,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 14:24:23,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:24:23,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:24:23,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:24:23,768 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:23 BoogieIcfgContainer [2018-10-04 14:24:23,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:24:23,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:24:23,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:24:23,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:24:23,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:23" (1/2) ... [2018-10-04 14:24:23,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2632d04d and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:24:23, skipping insertion in model container [2018-10-04 14:24:23,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:23" (2/2) ... [2018-10-04 14:24:23,776 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:24:23,786 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:24:23,794 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:24:23,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:24:23,849 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:24:23,850 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:24:23,850 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:24:23,850 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:24:23,850 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:24:23,850 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:24:23,851 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:24:23,851 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:24:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 14:24:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:24:23,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:23,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:24:23,876 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:23,883 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-04 14:24:23,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:23,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:23,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:24,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:24:24,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:24,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,081 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 14:24:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,167 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-04 14:24:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:24,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:24:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,201 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:24:24,202 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:24:24,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:24:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:24:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 14:24:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:24:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 14:24:24,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 14:24:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,265 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 14:24:24,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 14:24:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:24:24,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,266 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:24:24,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,266 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-04 14:24:24,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:24,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:24:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:24:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:24:24,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,338 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 14:24:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,405 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 14:24:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:24:24,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 14:24:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,409 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:24:24,409 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:24:24,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:24:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:24:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:24:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:24:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-04 14:24:24,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-04 14:24:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,419 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-04 14:24:24,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:24:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-04 14:24:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:24:24,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 14:24:24,421 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,421 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-04 14:24:24,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:24,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:24,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:24,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 14:24:24,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:24:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:24:24,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,863 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-10-04 14:24:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,977 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-04 14:24:24,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:24:24,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 14:24:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,979 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:24:24,979 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:24:24,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:24:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:24:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:24:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:24:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-04 14:24:24,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-04 14:24:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,986 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-04 14:24:24,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:24:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 14:24:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:24:24,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,988 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:24:24,988 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,988 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-04 14:24:24,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:24,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:25,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:25,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:25,276 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:25,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:24:25,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:25,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-04 14:24:25,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:24:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:24:25,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:25,470 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-10-04 14:24:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:25,925 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-04 14:24:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:24:25,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 14:24:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:25,927 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:24:25,927 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:24:25,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 9 [2018-10-04 14:24:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:24:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 14:24:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:24:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 14:24:25,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-04 14:24:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:25,933 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 14:24:25,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:24:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 14:24:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:24:25,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:25,935 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-04 14:24:25,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:25,935 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-04 14:24:25,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:24:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:26,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:26,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:26,080 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:24:26,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:26,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 14:24:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-04 14:24:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:24:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:24:26,274 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:26,275 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-10-04 14:24:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:26,461 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-04 14:24:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:24:26,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 14:24:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:26,463 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:24:26,463 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:24:26,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 6 [2018-10-04 14:24:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:24:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:24:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:24:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-04 14:24:26,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-04 14:24:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:26,470 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-04 14:24:26,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:24:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-04 14:24:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:24:26,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:26,471 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-04 14:24:26,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:26,471 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-04 14:24:26,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 14:24:26,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:26,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:26,783 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:26,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:26,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 14:24:26,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:26,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 14:24:26,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:24:26,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:24:26,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:26,901 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-10-04 14:24:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:26,960 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-04 14:24:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:24:26,962 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-10-04 14:24:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:26,963 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:24:26,963 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:24:26,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 14:24:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:24:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 14:24:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:24:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-10-04 14:24:26,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-10-04 14:24:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:26,969 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-10-04 14:24:26,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:24:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-10-04 14:24:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:24:26,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:26,970 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-10-04 14:24:26,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:26,971 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-10-04 14:24:26,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:26,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-04 14:24:27,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,267 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:27,276 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:27,302 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:24:27,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:27,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-04 14:24:27,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:27,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 14:24:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:24:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:24:27,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:27,401 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-10-04 14:24:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:27,464 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-04 14:24:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:24:27,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-10-04 14:24:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:27,466 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:24:27,466 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:24:27,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 8 [2018-10-04 14:24:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:24:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:24:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:24:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-04 14:24:27,473 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-10-04 14:24:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:27,473 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-04 14:24:27,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:24:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-04 14:24:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:24:27,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:27,474 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-10-04 14:24:27,474 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:27,474 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-10-04 14:24:27,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 14:24:27,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,635 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:27,665 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-10-04 14:24:27,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:27,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 14:24:27,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:27,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-10-04 14:24:27,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:24:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:24:27,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:27,838 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-10-04 14:24:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:28,622 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-10-04 14:24:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:24:28,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-04 14:24:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:28,624 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:24:28,624 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:24:28,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 14 [2018-10-04 14:24:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:24:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-04 14:24:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:24:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-10-04 14:24:28,635 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-10-04 14:24:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:28,636 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-10-04 14:24:28,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:24:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-10-04 14:24:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:24:28,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:28,637 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-10-04 14:24:28,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:28,638 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-10-04 14:24:28,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:28,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:28,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-04 14:24:28,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:28,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:28,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:28,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-04 14:24:29,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:29,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-04 14:24:29,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:24:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:24:29,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:29,133 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-10-04 14:24:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:29,233 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-10-04 14:24:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:24:29,237 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-10-04 14:24:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:29,238 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:24:29,238 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:24:29,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 10 [2018-10-04 14:24:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:24:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:24:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:24:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-10-04 14:24:29,253 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-10-04 14:24:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:29,256 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-10-04 14:24:29,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:24:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-10-04 14:24:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:24:29,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:29,257 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-10-04 14:24:29,258 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:29,258 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-10-04 14:24:29,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:24:29,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:29,526 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:29,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:29,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:29,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:24:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:29,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-10-04 14:24:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:24:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:24:29,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:29,720 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-10-04 14:24:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:29,840 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-04 14:24:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:24:29,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-04 14:24:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:29,845 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:24:29,845 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:24:29,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:24:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:24:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:24:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:24:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-10-04 14:24:29,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-10-04 14:24:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-10-04 14:24:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:24:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-10-04 14:24:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:24:29,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:29,864 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-10-04 14:24:29,865 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:29,865 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-10-04 14:24:29,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:29,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-04 14:24:30,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:30,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:30,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:24:30,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:30,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-04 14:24:30,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:30,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-10-04 14:24:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:24:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:24:30,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:30,650 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-10-04 14:24:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:30,735 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-10-04 14:24:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:24:30,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-04 14:24:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:30,743 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:24:30,743 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:24:30,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 12 [2018-10-04 14:24:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:24:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:24:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:24:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-10-04 14:24:30,756 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-10-04 14:24:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:30,756 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-04 14:24:30,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:24:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-10-04 14:24:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:24:30,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:30,759 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-10-04 14:24:30,759 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:30,759 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-10-04 14:24:30,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:30,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-04 14:24:31,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:31,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:31,154 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:31,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:31,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-04 14:24:31,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 14:24:31,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:24:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:24:31,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:31,294 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-10-04 14:24:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:31,325 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-10-04 14:24:31,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:24:31,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-04 14:24:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:31,326 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:24:31,326 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:24:31,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 14:24:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:24:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-04 14:24:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:24:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-04 14:24:31,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-10-04 14:24:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:31,340 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-04 14:24:31,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:24:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-04 14:24:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 14:24:31,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:31,342 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-10-04 14:24:31,342 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:31,342 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-10-04 14:24:31,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-04 14:24:31,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:31,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:31,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:31,717 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:24:31,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:31,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-04 14:24:32,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:32,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 14:24:32,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:24:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:24:32,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:32,496 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-10-04 14:24:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:32,779 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-10-04 14:24:32,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:24:32,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-04 14:24:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:32,781 INFO L225 Difference]: With dead ends: 77 [2018-10-04 14:24:32,781 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 14:24:32,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.2s impTime 7 [2018-10-04 14:24:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 14:24:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-10-04 14:24:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:24:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-10-04 14:24:32,811 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-10-04 14:24:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:32,814 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-10-04 14:24:32,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:24:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-10-04 14:24:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:24:32,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:32,815 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-10-04 14:24:32,816 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:32,816 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:32,816 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-10-04 14:24:32,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:32,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:32,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-04 14:24:33,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:33,281 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:33,397 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-04 14:24:33,397 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:33,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-04 14:24:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:24:33,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:24:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:24:33,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:33,614 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-10-04 14:24:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:33,674 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-04 14:24:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:24:33,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-04 14:24:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:33,675 INFO L225 Difference]: With dead ends: 89 [2018-10-04 14:24:33,675 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:24:33,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 8 [2018-10-04 14:24:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:24:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-10-04 14:24:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:24:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-10-04 14:24:33,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-10-04 14:24:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:33,695 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-10-04 14:24:33,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:24:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-10-04 14:24:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 14:24:33,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:33,697 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-10-04 14:24:33,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:33,697 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-10-04 14:24:33,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:33,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:33,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:33,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-04 14:24:34,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:34,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:34,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-04 14:24:34,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:34,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 14:24:34,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:24:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:24:34,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:34,431 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-10-04 14:24:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:34,521 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-10-04 14:24:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:24:34,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-10-04 14:24:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:34,524 INFO L225 Difference]: With dead ends: 101 [2018-10-04 14:24:34,524 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:24:34,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 9 [2018-10-04 14:24:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:24:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-04 14:24:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:24:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-04 14:24:34,546 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-10-04 14:24:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:34,547 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-04 14:24:34,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:24:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-04 14:24:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:24:34,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:34,548 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-04 14:24:34,548 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:34,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-10-04 14:24:34,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:34,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-04 14:24:34,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:34,873 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:34,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:34,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:34,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-04 14:24:35,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:35,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 14:24:35,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:24:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:24:35,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:35,548 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-10-04 14:24:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:35,628 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-04 14:24:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:24:35,628 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-04 14:24:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:35,629 INFO L225 Difference]: With dead ends: 113 [2018-10-04 14:24:35,630 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:24:35,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 10 [2018-10-04 14:24:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:24:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-04 14:24:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:24:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-04 14:24:35,657 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-04 14:24:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:35,658 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-04 14:24:35,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:24:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-04 14:24:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:24:35,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:35,660 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-04 14:24:35,660 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:35,660 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-10-04 14:24:35,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:35,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-04 14:24:35,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:35,936 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:35,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:36,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-10-04 14:24:36,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:36,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-04 14:24:36,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:24:36,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:24:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:24:36,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:36,383 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-10-04 14:24:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:36,497 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-04 14:24:36,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:24:36,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-10-04 14:24:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:36,499 INFO L225 Difference]: With dead ends: 125 [2018-10-04 14:24:36,499 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:24:36,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 11 [2018-10-04 14:24:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:24:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-04 14:24:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 14:24:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-04 14:24:36,527 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-04 14:24:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:36,527 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-04 14:24:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:24:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-04 14:24:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 14:24:36,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:36,530 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-04 14:24:36,530 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:36,530 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-10-04 14:24:36,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-04 14:24:36,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:36,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:36,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:36,979 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:36,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:36,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-04 14:24:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 14:24:37,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:24:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:24:37,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:37,407 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-10-04 14:24:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:37,507 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-04 14:24:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:24:37,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-10-04 14:24:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:37,508 INFO L225 Difference]: With dead ends: 137 [2018-10-04 14:24:37,508 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:24:37,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 12 [2018-10-04 14:24:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:24:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-04 14:24:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-04 14:24:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-04 14:24:37,540 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-04 14:24:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:37,540 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-04 14:24:37,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:24:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-04 14:24:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 14:24:37,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:37,542 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-04 14:24:37,542 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:37,542 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-10-04 14:24:37,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:37,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 14:24:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-04 14:24:42,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 14:24:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 14:24:42,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:42,147 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-10-04 14:24:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:44,779 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-10-04 14:24:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 14:24:44,780 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-10-04 14:24:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:44,780 INFO L225 Difference]: With dead ends: 5119 [2018-10-04 14:24:44,780 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:24:44,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time 3.7s impTime 101 [2018-10-04 14:24:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:24:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:24:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:24:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:24:44,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-10-04 14:24:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:44,791 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:24:44,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 14:24:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:24:44,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:24:44,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:24:50,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:50,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:51,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:52,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:53,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:54,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:55,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:56,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:56,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:56,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:56,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:56,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:57,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:58,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:24:59,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:00,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:00,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:00,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:00,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:00,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:01,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:01,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:01,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:01,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:01,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:02,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:03,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:03,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:03,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:04,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:05,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:05,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:05,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:06,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:07,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:07,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:07,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:07,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:07,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:08,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:08,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:08,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:09,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:09,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:09,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:10,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:11,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:11,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:11,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:11,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:12,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:12,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:12,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:14,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:14,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:15,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:16,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:16,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:16,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:17,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:18,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:18,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:18,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:18,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:18,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:19,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:19,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:19,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:20,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:20,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:21,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:22,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:22,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:23,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:23,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:23,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:24,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:24,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:25,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:25,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:26,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:28,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:29,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:29,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:29,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:29,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:31,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:32,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:33,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:39,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:39,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:41,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:41,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:42,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:44,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:48,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:48,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:51,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:53,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:54,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:25:55,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:26:10,870 WARN L178 SmtUtils]: Spent 1.43 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-10-04 14:26:11,785 WARN L178 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-04 14:27:40,759 WARN L178 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-10-04 14:27:47,471 WARN L178 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-04 14:27:47,477 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-10-04 14:27:47,478 INFO L421 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse24 (<= ULTIMATE.start_main_~j~5 7)) (.cse13 (<= ULTIMATE.start_main_~j~5 1)) (.cse11 (<= ULTIMATE.start_main_~j~5 9)) (.cse27 (<= ULTIMATE.start_main_~j~5 2)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse19 (<= ULTIMATE.start_main_~j~5 5)) (.cse21 (<= ULTIMATE.start_main_~j~5 3)) (.cse35 (<= ULTIMATE.start_main_~j~5 8)) (.cse31 (<= ULTIMATE.start_main_~j~5 4)) (.cse32 (<= ULTIMATE.start_main_~j~5 6)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse26 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse36 (<= 30 ULTIMATE.start_main_~k~5)) (.cse8 (<= 40 ULTIMATE.start_main_~k~5)) (.cse37 (<= 50 ULTIMATE.start_main_~k~5)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse20 (and .cse32 .cse4)) (.cse33 (and .cse31 .cse4)) (.cse1 (<= ULTIMATE.start_main_~i~5 5)) (.cse28 (and .cse35 .cse4)) (.cse12 (and .cse21 .cse4)) (.cse23 (and .cse19 .cse4)) (.cse10 (and .cse4 .cse39)) (.cse18 (<= 80 ULTIMATE.start_main_~k~5)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse22 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse29 (and .cse4 .cse27)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse14 (<= ULTIMATE.start_main_~i~5 0)) (.cse25 (<= ULTIMATE.start_main_~i~5 8)) (.cse38 (and .cse4 .cse11)) (.cse9 (<= ULTIMATE.start_main_~i~5 4)) (.cse17 (<= ULTIMATE.start_main_~i~5 3)) (.cse15 (and .cse13 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse2 (and .cse24 .cse4)) (.cse16 (<= ULTIMATE.start_main_~i~5 7))) (or (and .cse0 .cse1 (<= 57 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse11) (and .cse0 .cse12 .cse7 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse14) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse16) (and .cse0 .cse17 .cse4 .cse11 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse18 .cse16) (and .cse0 .cse19 .cse17 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse9) (and .cse0 .cse21 .cse17 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and (and .cse22 .cse23) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse24 .cse4 .cse14) (and .cse0 .cse25 .cse26 .cse4) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse27) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse28 .cse16) (and .cse0 .cse25 (<= 82 ULTIMATE.start_main_~k~5) .cse29) (and .cse0 .cse30 .cse21 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse4 .cse11 (<= 9 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse31 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse21 .cse4 .cse14) (and .cse0 .cse32 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse14) (and .cse0 .cse24 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse27 .cse14) (and .cse0 .cse30 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse27) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse33 .cse16) (and .cse0 .cse34 .cse10 .cse7) (and .cse0 .cse1 (<= 51 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 (<= 42 ULTIMATE.start_main_~k~5) .cse29 .cse9) (and .cse0 .cse6 .cse10 .cse16) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse22 .cse28)) (and .cse0 .cse25 (<= 87 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse11) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse19 .cse4) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse1 .cse20) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse27) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse1 .cse12) (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse9) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse7) (and (<= 93 ULTIMATE.start_main_~k~5) (and .cse22 .cse12)) (and .cse0 .cse1 (<= 55 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 .cse21 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse25 (<= 83 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse32 .cse30 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse26 (and .cse22 .cse10)) (and .cse0 .cse25 (<= 88 ULTIMATE.start_main_~k~5) .cse28) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse22 .cse4)) (and .cse0 .cse1 .cse29 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse30 .cse4 .cse36) (and .cse0 .cse25 (<= 86 ULTIMATE.start_main_~k~5) .cse20) (and .cse0 .cse33 .cse9 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse35 .cse4 .cse5) (and .cse0 .cse37 .cse9 .cse4) (and .cse0 .cse31 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse28 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse5) (and .cse0 .cse38 (<= 69 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse25 (<= 85 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 (<= 54 ULTIMATE.start_main_~k~5) .cse1 .cse33) (and .cse0 .cse19 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse38 .cse1 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and (and .cse22 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse0 .cse23 (<= 65 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse17 .cse4 .cse39 .cse36) (and .cse0 .cse30 .cse31 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse35 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse32 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and (and .cse22 .cse2) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse8 .cse17 .cse4) (and (and .cse22 .cse15) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 41 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 .cse33 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse2 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse24 .cse4) (and .cse0 .cse37 .cse1 .cse10) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse14) (and .cse0 .cse30 .cse35 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse17 .cse24 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse38 (<= 79 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse22 .cse33) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse1 .cse34) (and (and .cse22 .cse20) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 38 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse25 (<= 84 ULTIMATE.start_main_~k~5) .cse33) (and .cse0 .cse1 .cse28 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse24 .cse4 (<= 47 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse16) (and .cse0 .cse23 .cse16 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse21 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse31 (<= 34 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse32 .cse17 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse29 .cse16) (and .cse0 .cse25 .cse10 .cse18) (and .cse0 .cse29 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and (and .cse22 .cse29) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse0 .cse25 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse0 .cse40 .cse4 .cse14) (and .cse0 .cse25 (<= 81 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse38 .cse9 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse17 .cse15 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse2 .cse16)))) [2018-10-04 14:27:47,479 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-10-04 14:27:47,479 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-10-04 14:27:47,479 INFO L421 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-10-04 14:27:47,479 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-10-04 14:27:47,479 INFO L421 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-10-04 14:27:47,518 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:27:47 BoogieIcfgContainer [2018-10-04 14:27:47,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:27:47,519 INFO L168 Benchmark]: Toolchain (without parser) took 204128.57 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -724.0 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-04 14:27:47,521 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-04 14:27:47,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.26 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-04 14:27:47,522 INFO L168 Benchmark]: Boogie Preprocessor took 17.79 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-04 14:27:47,522 INFO L168 Benchmark]: RCFGBuilder took 316.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:27:47,523 INFO L168 Benchmark]: TraceAbstraction took 203749.24 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-04 14:27:47,533 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.23 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 41.26 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 17.79 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 316.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203749.24 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 42 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 87 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (93 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 83 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 86 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 85 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 5) && 59 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 65 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 4) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 41 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 73 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 4) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 203.6s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 182.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 392 SDslu, 554 SDs, 0 SdLazy, 744 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=18, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1927 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3229534 FormulaSimplificationTreeSizeReduction, 86.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 95.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 571602 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3238 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 12968/42447 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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-27-47-569.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-27-47-569.csv Received shutdown request...