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-133090d [2018-10-04 09:40:24,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:40:24,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:40:24,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:40:24,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:40:24,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:40:24,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:40:24,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:40:24,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:40:24,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:40:24,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:40:24,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:40:24,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:40:24,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:40:24,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:40:24,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:40:24,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:40:24,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:40:24,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:40:24,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:40:24,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:40:24,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:40:24,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:40:24,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:40:24,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:40:24,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:40:24,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:40:24,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:40:24,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:40:24,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:40:24,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:40:24,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:40:24,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:40:24,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:40:24,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:40:24,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:40:24,966 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 09:40:24,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:40:24,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:40:24,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:40:24,995 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:40:24,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:40:24,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:40:24,996 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:40:24,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:40:24,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:40:24,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:40:24,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:40:24,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:40:24,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:40:24,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:40:24,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:40:24,999 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:40:24,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:40:24,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:40:24,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:40:24,999 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:40:25,000 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:40:25,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:40:25,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:25,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:40:25,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:40:25,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:40:25,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:40:25,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:40:25,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:40:25,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:40:25,003 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:40:25,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:40:25,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:40:25,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:40:25,071 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:40:25,072 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:40:25,072 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 09:40:25,073 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 09:40:25,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:40:25,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:40:25,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:25,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:40:25,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:40:25,146 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,158 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:25,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:40:25,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:40:25,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:40:25,178 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,178 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,179 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,180 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,183 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,184 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,185 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 09:40:25" (1/1) ... [2018-10-04 09:40:25,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:40:25,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:40:25,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:40:25,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:40:25,189 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 09:40:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:25,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:40:25,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:40:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:40:25,515 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:40:25,515 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:40:25 BoogieIcfgContainer [2018-10-04 09:40:25,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:40:25,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:40:25,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:40:25,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:40:25,521 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 09:40:25" (1/2) ... [2018-10-04 09:40:25,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbab3bf and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:40:25, skipping insertion in model container [2018-10-04 09:40:25,522 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 09:40:25" (2/2) ... [2018-10-04 09:40:25,524 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 09:40:25,534 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:40:25,542 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:40:25,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:40:25,592 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:40:25,593 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:40:25,593 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:40:25,593 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:40:25,593 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:40:25,593 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:40:25,594 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:40:25,594 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:40:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 09:40:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:40:25,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:25,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:40:25,617 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:25,624 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:25,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-04 09:40:25,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:25,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:25,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:40:25,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:40:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:40:25,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:25,798 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 09:40:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:25,848 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-04 09:40:25,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:40:25,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:40:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:25,865 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:40:25,865 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:40:25,868 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 09:40:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:40:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 09:40:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:40:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 09:40:25,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 09:40:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:25,904 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 09:40:25,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:40:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 09:40:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:40:25,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:25,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:40:25,906 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:25,906 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-04 09:40:25,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:26,017 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 09:40:26,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:26,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:40:26,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:40:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:40:26,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:26,021 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 09:40:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:26,138 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 09:40:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:40:26,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 09:40:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:26,140 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:40:26,140 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:40:26,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 3 [2018-10-04 09:40:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:40:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:40:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:40:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-04 09:40:26,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-04 09:40:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:26,145 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-04 09:40:26,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:40:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-04 09:40:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:40:26,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:26,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 09:40:26,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:26,148 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-04 09:40:26,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:26,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:26,259 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 09:40:26,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:26,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:40:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:26,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:26,367 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 09:40:26,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:26,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 09:40:26,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:40:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:40:26,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:26,393 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-10-04 09:40:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:26,448 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-04 09:40:26,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:40:26,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 09:40:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:26,450 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:40:26,450 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:40:26,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 09:40:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:40:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:40:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:40:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-04 09:40:26,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-04 09:40:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:26,455 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-04 09:40:26,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:40:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 09:40:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:40:26,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:26,457 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 09:40:26,457 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:26,458 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-04 09:40:26,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:26,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:26,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:26,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:26,753 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 09:40:26,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:26,753 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 09:40:26,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:40:26,818 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:40:26,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:26,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:26,952 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 09:40:26,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:26,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-04 09:40:26,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:40:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:40:26,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:26,974 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-10-04 09:40:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:27,439 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-04 09:40:27,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:40:27,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 09:40:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:27,441 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:40:27,441 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:40:27,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 9 [2018-10-04 09:40:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:40:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-04 09:40:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:40:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-04 09:40:27,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-04 09:40:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:27,448 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-04 09:40:27,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:40:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-04 09:40:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:40:27,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:27,449 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-04 09:40:27,449 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:27,450 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-04 09:40:27,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:27,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:27,560 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 09:40:27,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:27,560 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 09:40:27,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:40:27,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:40:27,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:27,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:27,676 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 09:40:27,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:27,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-04 09:40:27,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:40:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:40:27,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:27,699 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-10-04 09:40:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:27,842 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-04 09:40:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:40:27,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 09:40:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:27,844 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:40:27,844 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:40:27,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:40:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:40:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 09:40:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:40:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-04 09:40:27,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-04 09:40:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:27,851 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-04 09:40:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:40:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-04 09:40:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:40:27,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:27,852 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-04 09:40:27,852 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:27,853 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-04 09:40:27,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:27,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:28,217 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 09:40:28,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:28,218 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 09:40:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:40:28,266 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:40:28,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:28,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:28,387 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 09:40:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 09:40:28,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:40:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:40:28,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:28,409 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-10-04 09:40:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:28,495 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-04 09:40:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:40:28,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-10-04 09:40:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:28,500 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:40:28,500 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:40:28,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 09:40:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:40:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 09:40:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:40:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-10-04 09:40:28,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-10-04 09:40:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:28,510 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-10-04 09:40:28,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:40:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-10-04 09:40:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:40:28,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:28,512 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-10-04 09:40:28,512 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:28,512 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:28,512 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-10-04 09:40:28,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:28,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:28,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:28,759 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 09:40:28,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:28,759 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 09:40:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:40:28,792 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:40:28,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:28,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:28,890 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 09:40:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:28,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 09:40:28,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:40:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:40:28,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:28,917 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-10-04 09:40:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:28,983 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-04 09:40:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:40:28,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-10-04 09:40:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:28,984 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:40:28,984 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:40:28,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:40:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:40:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:40:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:40:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-04 09:40:28,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-10-04 09:40:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:28,991 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-04 09:40:28,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:40:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-04 09:40:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:40:28,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:28,992 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-10-04 09:40:28,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:28,992 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-10-04 09:40:28,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:28,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:28,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:29,123 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 09:40:29,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:29,124 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 09:40:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:40:29,157 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-10-04 09:40:29,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:29,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:29,341 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 09:40:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:29,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-10-04 09:40:29,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:40:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:40:29,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:29,370 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-10-04 09:40:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:30,188 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-10-04 09:40:30,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:40:30,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-04 09:40:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:30,190 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:40:30,190 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:40:30,191 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 09:40:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:40:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-04 09:40:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:40:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-10-04 09:40:30,201 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-10-04 09:40:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:30,202 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-10-04 09:40:30,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:40:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-10-04 09:40:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:40:30,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:30,203 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-10-04 09:40:30,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:30,204 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-10-04 09:40:30,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:30,542 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 09:40:30,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:30,543 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 09:40:30,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:30,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:30,730 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 09:40:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-04 09:40:30,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:40:30,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:40:30,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:30,754 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-10-04 09:40:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:30,875 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-10-04 09:40:30,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:40:30,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-10-04 09:40:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:30,879 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:40:30,879 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:40:30,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 10 [2018-10-04 09:40:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:40:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:40:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:40:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-10-04 09:40:30,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-10-04 09:40:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:30,897 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-10-04 09:40:30,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:40:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-10-04 09:40:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:40:30,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:30,901 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-10-04 09:40:30,901 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:30,901 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-10-04 09:40:30,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:31,240 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 09:40:31,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:31,240 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 09:40:31,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:40:31,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:40:31,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:31,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:31,404 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 09:40:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:31,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-10-04 09:40:31,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:40:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:40:31,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:31,435 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-10-04 09:40:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:31,520 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-04 09:40:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:40:31,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-04 09:40:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:31,524 INFO L225 Difference]: With dead ends: 60 [2018-10-04 09:40:31,524 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:40:31,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 11 [2018-10-04 09:40:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:40:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:40:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:40:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-10-04 09:40:31,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-10-04 09:40:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:31,544 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-10-04 09:40:31,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:40:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-10-04 09:40:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:40:31,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:31,547 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-10-04 09:40:31,547 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:31,547 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-10-04 09:40:31,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:31,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:31,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:31,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:31,763 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 09:40:31,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:31,763 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 09:40:31,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:40:31,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 09:40:31,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:31,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:32,253 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 09:40:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:32,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-10-04 09:40:32,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:40:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:40:32,275 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:32,275 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-10-04 09:40:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:32,374 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-10-04 09:40:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:40:32,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-04 09:40:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:32,379 INFO L225 Difference]: With dead ends: 65 [2018-10-04 09:40:32,379 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:40:32,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 12 [2018-10-04 09:40:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:40:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 09:40:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 09:40:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-10-04 09:40:32,396 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-10-04 09:40:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-04 09:40:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:40:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-10-04 09:40:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:40:32,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:32,399 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-10-04 09:40:32,399 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:32,399 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-10-04 09:40:32,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:32,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:32,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:32,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:32,712 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 09:40:32,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:32,712 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 09:40:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:40:32,762 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:40:32,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:32,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:32,891 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 09:40:32,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:32,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 09:40:32,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:40:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:40:32,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:32,913 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-10-04 09:40:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:33,045 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-10-04 09:40:33,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:40:33,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-04 09:40:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:33,047 INFO L225 Difference]: With dead ends: 65 [2018-10-04 09:40:33,047 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:40:33,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 6 [2018-10-04 09:40:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:40:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-04 09:40:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 09:40:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-04 09:40:33,067 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-10-04 09:40:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:33,067 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-04 09:40:33,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:40:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-04 09:40:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 09:40:33,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:33,069 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-10-04 09:40:33,069 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:33,069 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-10-04 09:40:33,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:33,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:33,243 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 09:40:33,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:33,243 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 09:40:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:40:33,413 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 09:40:33,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:33,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:34,161 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 09:40:34,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:34,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 09:40:34,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:40:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:40:34,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:34,201 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-10-04 09:40:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:34,488 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-10-04 09:40:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:40:34,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-04 09:40:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:34,495 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:40:34,495 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 09:40:34,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.2s impTime 7 [2018-10-04 09:40:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 09:40:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-10-04 09:40:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 09:40:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-10-04 09:40:34,519 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-10-04 09:40:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-10-04 09:40:34,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:40:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-10-04 09:40:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 09:40:34,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:34,523 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-10-04 09:40:34,523 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:34,523 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-10-04 09:40:34,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:34,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:35,016 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 09:40:35,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:35,016 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 09:40:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:40:35,116 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-04 09:40:35,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:35,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:35,326 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 09:40:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 09:40:35,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:40:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:40:35,348 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:35,349 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-10-04 09:40:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:35,414 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-04 09:40:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:40:35,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-04 09:40:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:35,415 INFO L225 Difference]: With dead ends: 89 [2018-10-04 09:40:35,415 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 09:40:35,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 09:40:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 09:40:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-10-04 09:40:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 09:40:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-10-04 09:40:35,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-10-04 09:40:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:35,437 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-10-04 09:40:35,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:40:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-10-04 09:40:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 09:40:35,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:35,438 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-10-04 09:40:35,438 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:35,438 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-10-04 09:40:35,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:35,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:35,794 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 09:40:35,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:35,794 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 09:40:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:35,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:36,197 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 09:40:36,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:36,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 09:40:36,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:40:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:40:36,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:36,221 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-10-04 09:40:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:36,315 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-10-04 09:40:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:40:36,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-10-04 09:40:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:36,317 INFO L225 Difference]: With dead ends: 101 [2018-10-04 09:40:36,317 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 09:40:36,318 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 09:40:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 09:40:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-04 09:40:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 09:40:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-04 09:40:36,339 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-10-04 09:40:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:36,339 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-04 09:40:36,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:40:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-04 09:40:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 09:40:36,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:36,341 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-04 09:40:36,341 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:36,341 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-10-04 09:40:36,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:36,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:36,636 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 09:40:36,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:36,636 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 09:40:36,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:40:36,713 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:40:36,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:36,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:37,287 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 09:40:37,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:37,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 09:40:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 09:40:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 09:40:37,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:37,309 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-10-04 09:40:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:37,384 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-04 09:40:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:40:37,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-04 09:40:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:37,385 INFO L225 Difference]: With dead ends: 113 [2018-10-04 09:40:37,385 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 09:40:37,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime 10 [2018-10-04 09:40:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 09:40:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-04 09:40:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 09:40:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-04 09:40:37,410 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-04 09:40:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:37,411 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-04 09:40:37,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 09:40:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-04 09:40:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 09:40:37,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:37,413 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-04 09:40:37,413 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:37,413 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-10-04 09:40:37,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:37,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:37,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:38,355 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 09:40:38,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:38,355 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 09:40:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:40:38,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-10-04 09:40:38,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:38,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:38,826 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 09:40:38,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:38,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 09:40:38,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:40:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:40:38,848 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:38,849 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-10-04 09:40:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:38,946 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-04 09:40:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:40:38,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-10-04 09:40:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:38,947 INFO L225 Difference]: With dead ends: 125 [2018-10-04 09:40:38,947 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 09:40:38,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 11 [2018-10-04 09:40:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 09:40:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-04 09:40:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 09:40:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-04 09:40:38,994 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-04 09:40:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:38,995 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-04 09:40:38,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:40:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-04 09:40:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 09:40:38,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:38,998 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-04 09:40:38,998 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:38,998 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-10-04 09:40:39,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:39,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:39,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:39,379 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 09:40:39,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:40:39,380 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 09:40:39,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:40:39,477 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:40:39,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:40:39,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:40:39,896 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 09:40:39,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:40:39,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 09:40:39,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 09:40:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 09:40:39,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:39,918 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-10-04 09:40:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:40,005 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-04 09:40:40,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:40:40,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-10-04 09:40:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:40,007 INFO L225 Difference]: With dead ends: 137 [2018-10-04 09:40:40,007 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 09:40:40,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 12 [2018-10-04 09:40:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 09:40:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-04 09:40:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-04 09:40:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-04 09:40:40,037 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-04 09:40:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:40,038 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-04 09:40:40,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 09:40:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-04 09:40:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 09:40:40,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:40,039 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-04 09:40:40,039 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:40,040 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-10-04 09:40:40,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:40,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:40:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:40,485 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:40:40,729 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 09:40:41,076 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 09:40:42,910 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 09:40:44,051 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 09:40:44,405 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 09:40:44,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:44,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-04 09:40:44,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 09:40:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 09:40:44,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:44,410 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-10-04 09:40:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:47,006 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-10-04 09:40:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 09:40:47,007 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-10-04 09:40:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:47,007 INFO L225 Difference]: With dead ends: 5119 [2018-10-04 09:40:47,007 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:40:47,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.4s impTime 24 [2018-10-04 09:40:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:40:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:40:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:40:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:40:47,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-10-04 09:40:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:47,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:40:47,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 09:40:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:40:47,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:40:47,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:40:53,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:53,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:54,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:55,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:56,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:57,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:58,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:40:59,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:00,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:01,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:01,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:01,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:02,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:02,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:02,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:02,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:02,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:03,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:04,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:04,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:04,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:04,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:04,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:05,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:06,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:06,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:06,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:07,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:07,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:07,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:07,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:08,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:08,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:08,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:08,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:09,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:10,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:10,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:10,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:11,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:11,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:11,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:12,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:12,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:12,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:13,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:13,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:14,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:14,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:14,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:14,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:15,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:15,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:17,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:17,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:19,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:19,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:19,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:19,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:20,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:21,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:21,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:21,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:21,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:21,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:22,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:22,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:22,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:23,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:24,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:24,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:25,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:26,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:26,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:27,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:27,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:27,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:28,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:29,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:29,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:30,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:32,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:33,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:33,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:34,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:34,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:35,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:36,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:36,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:37,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:43,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:44,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:46,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:46,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:47,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:49,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:54,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:54,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:57,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:59,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:41:59,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:42:01,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:42:16,074 WARN L178 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-10-04 09:42:16,974 WARN L178 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-04 09:43:50,071 WARN L178 SmtUtils]: Spent 1.55 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-10-04 09:43:57,132 WARN L178 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-04 09:43:57,138 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-10-04 09:43:57,138 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-10-04 09:43:57,139 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 09:43:57,139 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-10-04 09:43:57,140 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-10-04 09:43:57,140 INFO L421 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-10-04 09:43:57,140 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 09:43:57,182 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:43:57 BoogieIcfgContainer [2018-10-04 09:43:57,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:43:57,183 INFO L168 Benchmark]: Toolchain (without parser) took 212060.16 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.5 GB in the beginning and 2.2 GB in the end (delta: -771.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-04 09:43:57,190 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:43:57,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:43:57,191 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:43:57,192 INFO L168 Benchmark]: RCFGBuilder took 328.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:43:57,193 INFO L168 Benchmark]: TraceAbstraction took 211665.80 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.2 GB in the end (delta: -792.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-04 09:43:57,198 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 328.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211665.80 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.2 GB in the end (delta: -792.9 MB). Peak memory consumption was 2.8 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, 211.5s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 190.1s 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.7s 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, 89.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 100.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.0s 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_09-43-57-219.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_09-43-57-219.csv Received shutdown request...