java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:02:33,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:02:33,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:02:33,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:02:33,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:02:33,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:02:33,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:02:33,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:02:33,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:02:33,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:02:33,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:02:33,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:02:33,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:02:33,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:02:33,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:02:33,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:02:33,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:02:33,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:02:33,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:02:33,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:02:33,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:02:33,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:02:33,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:02:33,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:02:33,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:02:33,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:02:33,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:02:33,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:02:33,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:02:33,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:02:33,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:02:33,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:02:33,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:02:33,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:02:33,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:02:33,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:02:33,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:02:33,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:02:33,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:02:33,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:02:33,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:02:33,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 20:02:33,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:02:33,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:02:33,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:02:33,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:02:33,311 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:02:33,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:02:33,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:02:33,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:02:33,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:02:33,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:02:33,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:02:33,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:02:33,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:02:33,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:02:33,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:02:33,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:02:33,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:02:33,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:02:33,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:02:33,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:02:33,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:02:33,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:02:33,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:02:33,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:02:33,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:02:33,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:02:33,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:02:33,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:02:33,374 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:02:33,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2019-09-03 20:02:33,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedcaabbc/7f6f0a724fcb45fea8ed7aad2796e9ff/FLAGd069bee42 [2019-09-03 20:02:33,806 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:02:33,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2019-09-03 20:02:33,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedcaabbc/7f6f0a724fcb45fea8ed7aad2796e9ff/FLAGd069bee42 [2019-09-03 20:02:34,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedcaabbc/7f6f0a724fcb45fea8ed7aad2796e9ff [2019-09-03 20:02:34,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:02:34,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:02:34,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:02:34,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:02:34,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:02:34,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61407083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34, skipping insertion in model container [2019-09-03 20:02:34,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:02:34,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:02:34,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:02:34,481 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:02:34,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:02:34,518 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:02:34,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34 WrapperNode [2019-09-03 20:02:34,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:02:34,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:02:34,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:02:34,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:02:34,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (1/1) ... [2019-09-03 20:02:34,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:02:34,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:02:34,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:02:34,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:02:34,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (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 [2019-09-03 20:02:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:02:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:02:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:02:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:02:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:02:34,929 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:02:34,929 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:02:34,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:02:34 BoogieIcfgContainer [2019-09-03 20:02:34,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:02:34,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:02:34,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:02:34,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:02:34,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:02:34" (1/3) ... [2019-09-03 20:02:34,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cdd1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:02:34, skipping insertion in model container [2019-09-03 20:02:34,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:02:34" (2/3) ... [2019-09-03 20:02:34,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cdd1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:02:34, skipping insertion in model container [2019-09-03 20:02:34,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:02:34" (3/3) ... [2019-09-03 20:02:34,938 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-1.i [2019-09-03 20:02:34,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:02:34,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:02:35,005 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:02:35,041 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:02:35,042 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:02:35,042 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:02:35,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:02:35,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:02:35,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:02:35,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:02:35,044 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:02:35,044 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:02:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:02:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:02:35,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:35,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:35,091 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1266359381, now seen corresponding path program 1 times [2019-09-03 20:02:35,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:35,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:35,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:02:35,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:02:35,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:02:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:02:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:02:35,261 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2019-09-03 20:02:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:35,347 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-09-03 20:02:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:02:35,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:02:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:35,355 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:02:35,355 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:02:35,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:02:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:02:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-09-03 20:02:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:02:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:02:35,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 20:02:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:35,396 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:02:35,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:02:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:02:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:02:35,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:35,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:35,398 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1008321469, now seen corresponding path program 1 times [2019-09-03 20:02:35,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:35,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:02:35,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:02:35,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:02:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:02:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:02:35,449 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2019-09-03 20:02:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:35,491 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-09-03 20:02:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:02:35,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-03 20:02:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:35,494 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:02:35,495 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:02:35,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:02:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:02:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-03 20:02:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:02:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 20:02:35,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-09-03 20:02:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:35,502 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 20:02:35,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:02:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 20:02:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:02:35,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:35,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:35,503 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1823795457, now seen corresponding path program 1 times [2019-09-03 20:02:35,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:35,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:35,573 INFO L223 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 [2019-09-03 20:02:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:35,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:02:35,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:35,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:35,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-03 20:02:35,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:02:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:02:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:02:35,674 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-03 20:02:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:35,720 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 20:02:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:02:35,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-03 20:02:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:35,722 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:02:35,722 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:02:35,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:02:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:02:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-03 20:02:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:02:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 20:02:35,729 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-03 20:02:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:35,729 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 20:02:35,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:02:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 20:02:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:02:35,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:35,731 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:35,731 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 478895679, now seen corresponding path program 2 times [2019-09-03 20:02:35,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:02:35,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:35,808 INFO L223 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 [2019-09-03 20:02:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:35,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:35,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:35,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:02:35,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-03 20:02:35,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:02:35,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:02:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:02:35,919 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-03 20:02:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:36,235 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-09-03 20:02:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:02:36,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-03 20:02:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:36,237 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:02:36,237 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:02:36,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:02:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:02:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2019-09-03 20:02:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:02:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 20:02:36,246 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 19 [2019-09-03 20:02:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:36,246 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 20:02:36,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:02:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 20:02:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:02:36,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:36,248 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:36,248 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -441049109, now seen corresponding path program 3 times [2019-09-03 20:02:36,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-03 20:02:36,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:36,335 INFO L223 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) [2019-09-03 20:02:36,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:36,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:02:36,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:36,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:02:36,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-03 20:02:36,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-03 20:02:36,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:02:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:02:36,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:02:36,457 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-03 20:02:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:36,511 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-09-03 20:02:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:02:36,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-03 20:02:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:36,512 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:02:36,512 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:02:36,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:02:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:02:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:02:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:02:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-03 20:02:36,520 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-09-03 20:02:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:36,521 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-03 20:02:36,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:02:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-03 20:02:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:02:36,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:36,522 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:36,523 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1891685973, now seen corresponding path program 4 times [2019-09-03 20:02:36,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:02:36,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:36,631 INFO L223 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) [2019-09-03 20:02:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:36,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:36,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:36,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:02:36,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:02:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-03 20:02:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:02:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:02:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:02:36,761 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 13 states. [2019-09-03 20:02:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:36,831 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-09-03 20:02:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:02:36,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-03 20:02:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:36,835 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:02:36,835 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:02:36,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:02:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:02:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-03 20:02:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:02:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-03 20:02:36,850 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2019-09-03 20:02:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:36,851 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-03 20:02:36,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:02:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-03 20:02:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:02:36,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:36,856 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:36,856 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:36,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash -98733461, now seen corresponding path program 5 times [2019-09-03 20:02:36,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:36,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:36,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 20:02:36,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:36,976 INFO L223 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) [2019-09-03 20:02:36,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:37,024 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 20:02:37,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:37,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:02:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 20:02:37,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:37,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-03 20:02:37,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:02:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:02:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:02:37,120 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 15 states. [2019-09-03 20:02:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:37,182 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-03 20:02:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:02:37,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-09-03 20:02:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:37,184 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:02:37,184 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:02:37,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:02:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:02:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-03 20:02:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:02:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-09-03 20:02:37,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2019-09-03 20:02:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:37,194 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-09-03 20:02:37,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:02:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-09-03 20:02:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:02:37,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:37,195 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:37,196 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:37,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148565, now seen corresponding path program 6 times [2019-09-03 20:02:37,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:37,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:37,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:37,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-03 20:02:37,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:37,336 INFO L223 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) [2019-09-03 20:02:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:37,375 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-09-03 20:02:37,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:37,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:02:37,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:02:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:37,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-09-03 20:02:37,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:02:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:02:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:02:37,462 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 14 states. [2019-09-03 20:02:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:38,153 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2019-09-03 20:02:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:02:38,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-09-03 20:02:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:38,155 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:02:38,155 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 20:02:38,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=668, Invalid=1402, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:02:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 20:02:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2019-09-03 20:02:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:02:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2019-09-03 20:02:38,168 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 42 [2019-09-03 20:02:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:38,169 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2019-09-03 20:02:38,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:02:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2019-09-03 20:02:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:02:38,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:38,171 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:38,171 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1542827339, now seen corresponding path program 7 times [2019-09-03 20:02:38,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-09-03 20:02:38,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:38,277 INFO L223 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 [2019-09-03 20:02:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:38,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:02:38,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:02:38,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:38,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-03 20:02:38,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:02:38,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:02:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:02:38,486 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 19 states. [2019-09-03 20:02:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:38,559 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-09-03 20:02:38,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:02:38,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2019-09-03 20:02:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:38,565 INFO L225 Difference]: With dead ends: 114 [2019-09-03 20:02:38,565 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:02:38,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:02:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:02:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2019-09-03 20:02:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:02:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-03 20:02:38,589 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2019-09-03 20:02:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:38,591 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-03 20:02:38,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:02:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-03 20:02:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:02:38,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:38,597 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:38,597 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1910289101, now seen corresponding path program 8 times [2019-09-03 20:02:38,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:38,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-03 20:02:38,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:38,799 INFO L223 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 [2019-09-03 20:02:38,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:38,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:38,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:38,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:02:38,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-03 20:02:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:38,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-03 20:02:38,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:02:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:02:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:02:38,997 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 21 states. [2019-09-03 20:02:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:39,056 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-09-03 20:02:39,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:02:39,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-03 20:02:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:39,060 INFO L225 Difference]: With dead ends: 124 [2019-09-03 20:02:39,060 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:02:39,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:02:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:02:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-09-03 20:02:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:02:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-03 20:02:39,092 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 69 [2019-09-03 20:02:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:39,093 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-03 20:02:39,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:02:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-03 20:02:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:02:39,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:39,095 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:39,095 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1389547215, now seen corresponding path program 9 times [2019-09-03 20:02:39,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:39,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 365 proven. 81 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-09-03 20:02:39,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:39,241 INFO L223 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 [2019-09-03 20:02:39,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:39,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:02:39,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:39,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:02:39,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 367 proven. 81 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-03 20:02:39,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:39,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-09-03 20:02:39,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:02:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:02:39,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:02:39,463 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 23 states. [2019-09-03 20:02:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:39,544 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-09-03 20:02:39,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:02:39,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-03 20:02:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:39,545 INFO L225 Difference]: With dead ends: 134 [2019-09-03 20:02:39,545 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:02:39,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:02:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:02:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-09-03 20:02:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:02:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-09-03 20:02:39,556 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 75 [2019-09-03 20:02:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:39,556 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-09-03 20:02:39,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:02:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-09-03 20:02:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:02:39,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:39,558 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:39,558 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1348099759, now seen corresponding path program 10 times [2019-09-03 20:02:39,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:39,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:39,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:39,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-03 20:02:39,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:39,634 INFO L223 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 [2019-09-03 20:02:39,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:39,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:39,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:39,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:02:39,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-03 20:02:39,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-03 20:02:39,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:02:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:02:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:02:39,794 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 11 states. [2019-09-03 20:02:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:39,840 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-09-03 20:02:39,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:02:39,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-03 20:02:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:39,842 INFO L225 Difference]: With dead ends: 132 [2019-09-03 20:02:39,842 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 20:02:39,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:02:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 20:02:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2019-09-03 20:02:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:02:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-09-03 20:02:39,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 81 [2019-09-03 20:02:39,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:39,862 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-09-03 20:02:39,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:02:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-09-03 20:02:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:02:39,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:39,863 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:39,863 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1467049301, now seen corresponding path program 11 times [2019-09-03 20:02:39,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:02:39,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:39,984 INFO L223 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) [2019-09-03 20:02:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:40,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-09-03 20:02:40,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:40,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:02:40,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 20:02:40,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:40,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-03 20:02:40,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:02:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:02:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:02:40,192 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 13 states. [2019-09-03 20:02:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:40,247 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2019-09-03 20:02:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:02:40,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-03 20:02:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:40,249 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:02:40,249 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:02:40,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:02:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:02:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 128. [2019-09-03 20:02:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:02:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2019-09-03 20:02:40,273 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 104 [2019-09-03 20:02:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:40,275 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2019-09-03 20:02:40,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:02:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2019-09-03 20:02:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:02:40,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:40,277 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:40,277 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1018125521, now seen corresponding path program 12 times [2019-09-03 20:02:40,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:40,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-09-03 20:02:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:40,475 INFO L223 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 [2019-09-03 20:02:40,485 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:02:40,599 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-03 20:02:40,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:40,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:02:40,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:02:40,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:40,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-03 20:02:40,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:02:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:02:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:02:40,714 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 15 states. [2019-09-03 20:02:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:40,760 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2019-09-03 20:02:40,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:02:40,761 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2019-09-03 20:02:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:40,762 INFO L225 Difference]: With dead ends: 178 [2019-09-03 20:02:40,763 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:02:40,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:02:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:02:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2019-09-03 20:02:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:02:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2019-09-03 20:02:40,776 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 127 [2019-09-03 20:02:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:40,777 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2019-09-03 20:02:40,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:02:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2019-09-03 20:02:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:02:40,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:40,778 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:40,779 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1416411605, now seen corresponding path program 13 times [2019-09-03 20:02:40,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:40,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:40,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 20:02:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:40,951 INFO L223 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) [2019-09-03 20:02:40,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:41,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:02:41,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:02:41,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:41,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-03 20:02:41,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:02:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:02:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:02:41,225 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 17 states. [2019-09-03 20:02:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:41,283 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2019-09-03 20:02:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:02:41,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2019-09-03 20:02:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:41,285 INFO L225 Difference]: With dead ends: 201 [2019-09-03 20:02:41,285 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 20:02:41,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:02:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 20:02:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2019-09-03 20:02:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 20:02:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 181 transitions. [2019-09-03 20:02:41,302 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 181 transitions. Word has length 150 [2019-09-03 20:02:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:41,303 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 181 transitions. [2019-09-03 20:02:41,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:02:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 181 transitions. [2019-09-03 20:02:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:02:41,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:41,305 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:41,305 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1492973649, now seen corresponding path program 14 times [2019-09-03 20:02:41,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-09-03 20:02:41,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:41,570 INFO L223 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 [2019-09-03 20:02:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:41,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:41,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:41,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:02:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2019-09-03 20:02:41,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-03 20:02:41,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:02:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:02:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:02:41,824 INFO L87 Difference]: Start difference. First operand 174 states and 181 transitions. Second operand 19 states. [2019-09-03 20:02:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:41,893 INFO L93 Difference]: Finished difference Result 224 states and 233 transitions. [2019-09-03 20:02:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:02:41,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 173 [2019-09-03 20:02:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:41,896 INFO L225 Difference]: With dead ends: 224 [2019-09-03 20:02:41,896 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 20:02:41,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:02:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 20:02:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2019-09-03 20:02:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 20:02:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2019-09-03 20:02:41,913 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 173 [2019-09-03 20:02:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:41,913 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2019-09-03 20:02:41,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:02:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2019-09-03 20:02:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 20:02:41,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:41,915 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:41,916 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1547162027, now seen corresponding path program 15 times [2019-09-03 20:02:41,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:41,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-03 20:02:42,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:42,164 INFO L223 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 [2019-09-03 20:02:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:42,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 20:02:42,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:42,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:02:42,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-09-03 20:02:42,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:42,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-03 20:02:42,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:02:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:02:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:02:42,565 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 21 states. [2019-09-03 20:02:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:42,639 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2019-09-03 20:02:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:02:42,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 196 [2019-09-03 20:02:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:42,641 INFO L225 Difference]: With dead ends: 247 [2019-09-03 20:02:42,641 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 20:02:42,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:02:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 20:02:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 220. [2019-09-03 20:02:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-03 20:02:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 229 transitions. [2019-09-03 20:02:42,662 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 229 transitions. Word has length 196 [2019-09-03 20:02:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:42,663 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 229 transitions. [2019-09-03 20:02:42,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:02:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 229 transitions. [2019-09-03 20:02:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-03 20:02:42,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:42,666 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:42,667 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1463389231, now seen corresponding path program 16 times [2019-09-03 20:02:42,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:42,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 20:02:42,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:42,964 INFO L223 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 [2019-09-03 20:02:42,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:43,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:43,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:43,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:02:43,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-03 20:02:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-09-03 20:02:43,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:02:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:02:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:02:43,414 INFO L87 Difference]: Start difference. First operand 220 states and 229 transitions. Second operand 23 states. [2019-09-03 20:02:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:43,510 INFO L93 Difference]: Finished difference Result 270 states and 281 transitions. [2019-09-03 20:02:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:02:43,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 219 [2019-09-03 20:02:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:43,512 INFO L225 Difference]: With dead ends: 270 [2019-09-03 20:02:43,512 INFO L226 Difference]: Without dead ends: 265 [2019-09-03 20:02:43,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:02:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-03 20:02:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2019-09-03 20:02:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-03 20:02:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 253 transitions. [2019-09-03 20:02:43,532 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 253 transitions. Word has length 219 [2019-09-03 20:02:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:43,533 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 253 transitions. [2019-09-03 20:02:43,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:02:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 253 transitions. [2019-09-03 20:02:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-03 20:02:43,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:43,536 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:43,536 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:43,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1649132245, now seen corresponding path program 17 times [2019-09-03 20:02:43,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:43,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:43,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 11036 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:02:48,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:02:48,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2019-09-03 20:02:48,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:02:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:02:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:02:48,351 INFO L87 Difference]: Start difference. First operand 243 states and 253 transitions. Second operand 105 states. [2019-09-03 20:02:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:50,007 INFO L93 Difference]: Finished difference Result 9783 states and 10243 transitions. [2019-09-03 20:02:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:02:50,007 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 242 [2019-09-03 20:02:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:50,008 INFO L225 Difference]: With dead ends: 9783 [2019-09-03 20:02:50,008 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:02:50,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:02:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:02:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:02:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:02:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:02:50,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2019-09-03 20:02:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:50,029 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:02:50,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:02:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:02:50,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:02:50,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:02:51,762 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 675 DAG size of output: 666 [2019-09-03 20:04:02,670 WARN L188 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 5174 DAG size of output: 1934 [2019-09-03 20:04:09,561 WARN L188 SmtUtils]: Spent 6.85 s on a formula simplification. DAG size of input: 666 DAG size of output: 59 [2019-09-03 20:05:22,891 WARN L188 SmtUtils]: Spent 1.22 m on a formula simplification. DAG size of input: 1910 DAG size of output: 364 [2019-09-03 20:05:22,895 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:05:22,895 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:05:22,895 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:05:22,895 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:05:22,896 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:05:22,896 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:05:22,896 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2019-09-03 20:05:22,896 INFO L443 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-09-03 20:05:22,896 INFO L443 ceAbstractionStarter]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2019-09-03 20:05:22,896 INFO L439 ceAbstractionStarter]: At program point L17-3(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 main_~m~0)) (.cse1 (<= 10 main_~n~0))) (or (and (<= 30 main_~k~0) (<= main_~i~0 3) .cse0 .cse1) (and .cse0 (<= 100 main_~k~0) .cse1) (and .cse0 (<= 40 main_~k~0) (<= main_~i~0 4) .cse1) (and .cse0 (<= 0 main_~k~0) (<= main_~i~0 0) .cse1) (and .cse0 (<= 60 main_~k~0) (<= main_~i~0 6) .cse1) (and .cse0 (<= 10 main_~k~0) (<= main_~i~0 1) .cse1) (and (<= 80 main_~k~0) .cse0 (<= main_~i~0 8) .cse1) (and (<= 50 main_~k~0) .cse0 (<= main_~i~0 5) .cse1) (and .cse0 (<= main_~i~0 9) .cse1 (<= 90 main_~k~0)) (and (<= 70 main_~k~0) .cse0 (<= main_~i~0 7) .cse1) (and .cse0 (<= 20 main_~k~0) (<= main_~i~0 2) .cse1))) [2019-09-03 20:05:22,896 INFO L439 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (and (<= 10 main_~m~0) (<= 100 main_~k~0) (<= 10 main_~n~0)) [2019-09-03 20:05:22,897 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2019-09-03 20:05:22,897 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2019-09-03 20:05:22,897 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-09-03 20:05:22,897 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-09-03 20:05:22,897 INFO L443 ceAbstractionStarter]: For program point L18-2(lines 18 20) no Hoare annotation was computed. [2019-09-03 20:05:22,898 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse34 (<= main_~j~0 8)) (.cse13 (<= main_~j~0 3)) (.cse41 (<= main_~j~0 5)) (.cse0 (<= 10 main_~m~0))) (let ((.cse22 (<= main_~j~0 4)) (.cse1 (<= main_~j~0 1)) (.cse39 (<= main_~j~0 0)) (.cse12 (<= main_~j~0 2)) (.cse15 (<= main_~j~0 7)) (.cse5 (<= main_~j~0 6)) (.cse9 (and .cse41 .cse0)) (.cse42 (and .cse0 .cse13)) (.cse3 (<= 10 main_~n~0)) (.cse24 (and .cse34 .cse0))) (let ((.cse25 (<= 50 main_~k~0)) (.cse35 (and .cse3 .cse24)) (.cse29 (<= 40 main_~k~0)) (.cse30 (<= 60 main_~k~0)) (.cse7 (and .cse42 .cse3)) (.cse19 (and .cse3 .cse9)) (.cse33 (<= 10 main_~k~0)) (.cse32 (<= 90 main_~k~0)) (.cse38 (<= 30 main_~k~0)) (.cse16 (and .cse0 .cse5)) (.cse36 (<= 20 main_~k~0)) (.cse28 (and .cse0 .cse15)) (.cse31 (and .cse0 .cse12)) (.cse37 (<= 70 main_~k~0)) (.cse40 (<= 80 main_~k~0)) (.cse6 (<= main_~i~0 8)) (.cse26 (and .cse0 .cse39)) (.cse17 (<= (+ main_~i~0 1) main_~n~0)) (.cse11 (<= main_~i~0 3)) (.cse2 (<= main_~i~0 1)) (.cse10 (and .cse0 .cse1)) (.cse14 (<= main_~i~0 4)) (.cse21 (<= main_~i~0 2)) (.cse8 (<= main_~i~0 5)) (.cse4 (<= main_~i~0 6)) (.cse18 (<= main_~j~0 9)) (.cse20 (<= main_~i~0 0)) (.cse23 (and .cse0 .cse22 .cse3)) (.cse27 (<= main_~i~0 7))) (or (and (<= 11 main_~k~0) .cse0 .cse1 .cse2 .cse3) (and (<= 66 main_~k~0) .cse0 .cse4 .cse3 .cse5) (and (<= 83 main_~k~0) .cse6 .cse7) (and .cse0 (<= 56 main_~k~0) .cse8 .cse3 .cse5) (and (<= 65 main_~k~0) .cse4 .cse3 .cse9) (and .cse10 .cse4 (<= 61 main_~k~0) .cse3) (and .cse11 .cse0 .cse12 (<= 32 main_~k~0) .cse3) (and .cse0 .cse13 .cse14 (<= 43 main_~k~0) .cse3) (and .cse0 .cse2 (<= 17 main_~k~0) .cse15 .cse3) (and (<= 33 main_~k~0) .cse11 .cse0 .cse13 .cse3) (and (<= 86 main_~k~0) .cse16 .cse6 .cse3) (and (<= 99 main_~k~0) (and .cse17 .cse0 .cse18 .cse3)) (and (<= 95 main_~k~0) (and .cse17 .cse19)) (and (<= 69 main_~k~0) .cse0 .cse18 .cse4 .cse3) (and (<= 2 main_~k~0) .cse0 .cse12 .cse20 .cse3) (and .cse0 (<= 26 main_~k~0) .cse21 .cse3 .cse5) (and .cse0 .cse22 .cse20 (<= 4 main_~k~0) .cse3) (and (<= 84 main_~k~0) .cse23 .cse6) (and (<= 58 main_~k~0) .cse8 .cse3 .cse24) (and .cse25 .cse8 .cse26 .cse3) (and .cse27 (<= 77 main_~k~0) .cse3 .cse28) (and .cse29 .cse14 .cse26 .cse3) (and .cse30 .cse26 .cse4 .cse3) (and .cse9 (<= 45 main_~k~0) .cse14 .cse3) (and (and .cse17 .cse31 .cse3) (<= 92 main_~k~0)) (and (<= 16 main_~k~0) .cse0 .cse2 .cse3 .cse5) (and (<= 71 main_~k~0) .cse10 .cse27 .cse3) (and (and .cse17 .cse26 .cse3) .cse32) (and .cse11 .cse0 .cse22 (<= 34 main_~k~0) .cse3) (and (<= 67 main_~k~0) .cse4 .cse3 .cse28) (and .cse0 .cse33 .cse20 .cse3) (and .cse34 (<= 28 main_~k~0) .cse0 .cse21 .cse3) (and (<= 82 main_~k~0) .cse31 .cse6 .cse3) (and .cse25 .cse14 .cse0 .cse3) (and .cse0 (<= 6 main_~k~0) .cse20 .cse3 .cse5) (and (<= 21 main_~k~0) .cse0 .cse1 .cse21 .cse3) (and (and .cse17 .cse35) (<= 98 main_~k~0)) (and .cse11 .cse0 (<= 39 main_~k~0) .cse18 .cse3) (and (<= 89 main_~k~0) .cse0 .cse6 .cse18 .cse3) (and .cse0 (<= 7 main_~k~0) .cse15 .cse20 .cse3) (and .cse0 .cse13 .cse2 (<= 13 main_~k~0) .cse3) (and .cse0 .cse36 .cse2 .cse3) (and .cse14 .cse28 (<= 47 main_~k~0) .cse3) (and .cse19 (<= 85 main_~k~0) .cse6) (and .cse35 .cse6 (<= 88 main_~k~0)) (and .cse8 .cse28 .cse3 (<= 57 main_~k~0)) (and (<= 81 main_~k~0) .cse6 .cse10 .cse3) (and .cse11 .cse0 .cse29 .cse3) (and .cse37 .cse0 .cse4 .cse3) (and .cse0 .cse30 .cse8 .cse3) (and (and .cse17 .cse28 .cse3) (<= 97 main_~k~0)) (and .cse11 .cse0 .cse1 .cse3 (<= 31 main_~k~0)) (and .cse0 (<= 22 main_~k~0) .cse21 .cse12 .cse3) (and (and .cse17 .cse7) (<= 93 main_~k~0)) (and .cse31 .cse14 (<= 42 main_~k~0) .cse3) (and .cse38 .cse11 .cse0 .cse39 .cse3) (and .cse19 (<= 75 main_~k~0) .cse27) (and (<= 78 main_~k~0) .cse27 .cse3 .cse24) (and .cse40 .cse0 .cse27 .cse3) (and (<= 54 main_~k~0) .cse23 .cse8) (and .cse0 .cse18 .cse27 (<= 79 main_~k~0) .cse3) (and .cse0 (<= 29 main_~k~0) .cse21 .cse18 .cse3) (and .cse16 .cse27 .cse3 (<= 76 main_~k~0)) (and .cse41 .cse0 (<= 25 main_~k~0) .cse21 .cse3) (and .cse0 (<= 0 main_~k~0) .cse39 .cse20 .cse3) (and .cse0 .cse33 .cse2 .cse39 .cse3) (and .cse0 .cse14 .cse22 (<= 44 main_~k~0) .cse3) (and (<= 53 main_~k~0) .cse42 .cse8 .cse3) (and .cse31 .cse27 (<= 72 main_~k~0) .cse3) (and .cse0 .cse6 .cse3 .cse32) (and (<= 23 main_~k~0) .cse0 .cse13 .cse21 .cse3) (and .cse0 .cse14 .cse18 (<= 49 main_~k~0) .cse3) (and (<= 63 main_~k~0) .cse42 .cse4 .cse3) (and .cse0 .cse21 .cse22 .cse3 (<= 24 main_~k~0)) (and .cse41 .cse0 (<= 5 main_~k~0) .cse20 .cse3) (and .cse31 .cse8 (<= 52 main_~k~0) .cse3) (and .cse0 .cse1 .cse20 .cse3 (<= 1 main_~k~0)) (and .cse38 .cse0 .cse21 .cse3) (and (<= 37 main_~k~0) .cse11 .cse0 .cse15 .cse3) (and .cse0 .cse13 (<= 3 main_~k~0) .cse20 .cse3) (and .cse11 .cse0 (<= 36 main_~k~0) .cse3 .cse5) (and (<= 96 main_~k~0) (and .cse17 .cse16 .cse3)) (and .cse0 .cse14 (<= 46 main_~k~0) .cse3 .cse5) (and .cse10 .cse8 .cse3 (<= 51 main_~k~0)) (and .cse0 .cse2 .cse12 (<= 12 main_~k~0) .cse3) (and .cse11 .cse41 .cse0 (<= 35 main_~k~0) .cse3) (and .cse0 .cse36 .cse21 .cse39 .cse3) (and .cse14 (<= 48 main_~k~0) .cse3 .cse24) (and .cse0 .cse2 .cse18 .cse3 (<= 19 main_~k~0)) (and .cse41 .cse0 (<= 15 main_~k~0) .cse2 .cse3) (and (and .cse17 .cse10 .cse3) (<= 91 main_~k~0)) (and .cse34 .cse0 (<= 8 main_~k~0) .cse20 .cse3) (and .cse28 .cse6 (<= 87 main_~k~0) .cse3) (and .cse31 (<= 62 main_~k~0) .cse4 .cse3) (and .cse37 .cse26 .cse27 .cse3) (and (<= 100 main_~k~0) (and .cse17 .cse0 .cse3)) (and (<= 68 main_~k~0) .cse4 .cse3 .cse24) (and .cse34 .cse0 (<= 18 main_~k~0) .cse2 .cse3) (and (<= 59 main_~k~0) .cse0 .cse8 .cse18 .cse3) (and .cse40 .cse6 .cse26 .cse3) (and (and .cse17 .cse23) (<= 94 main_~k~0)) (and .cse11 .cse34 .cse0 (<= 38 main_~k~0) .cse3) (and (<= 14 main_~k~0) .cse0 .cse2 .cse22 .cse3) (and .cse42 .cse27 .cse3 (<= 73 main_~k~0)) (and .cse10 .cse14 (<= 41 main_~k~0) .cse3) (and .cse0 .cse21 .cse15 .cse3 (<= 27 main_~k~0)) (and .cse9 (<= 55 main_~k~0) .cse8 .cse3) (and (<= 64 main_~k~0) .cse23 .cse4) (and .cse0 (<= 9 main_~k~0) .cse18 .cse20 .cse3) (and (<= 74 main_~k~0) .cse23 .cse27))))) [2019-09-03 20:05:22,898 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 20:05:22,899 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 20:05:22,899 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 20:05:22,899 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 20:05:22,899 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 20:05:22,899 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 20:05:22,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:05:22 BoogieIcfgContainer [2019-09-03 20:05:22,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:05:22,943 INFO L168 Benchmark]: Toolchain (without parser) took 168738.66 ms. Allocated memory was 138.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 87.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,944 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.53 ms. Allocated memory is still 138.9 MB. Free memory was 87.3 MB in the beginning and 77.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,946 INFO L168 Benchmark]: Boogie Preprocessor took 154.40 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 77.7 MB in the beginning and 177.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,946 INFO L168 Benchmark]: RCFGBuilder took 256.67 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 165.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,947 INFO L168 Benchmark]: TraceAbstraction took 168009.67 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 164.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-03 20:05:22,951 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.53 ms. Allocated memory is still 138.9 MB. Free memory was 87.3 MB in the beginning and 77.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.40 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 77.7 MB in the beginning and 177.8 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 256.67 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 165.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168009.67 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 164.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((30 <= k && i <= 3) && 10 <= m) && 10 <= n) || ((10 <= m && 100 <= k) && 10 <= n)) || (((10 <= m && 40 <= k) && i <= 4) && 10 <= n)) || (((10 <= m && 0 <= k) && i <= 0) && 10 <= n)) || (((10 <= m && 60 <= k) && i <= 6) && 10 <= n)) || (((10 <= m && 10 <= k) && i <= 1) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 8) && 10 <= n)) || (((50 <= k && 10 <= m) && i <= 5) && 10 <= n)) || (((10 <= m && i <= 9) && 10 <= n) && 90 <= k)) || (((70 <= k && 10 <= m) && i <= 7) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 2) && 10 <= n) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((11 <= k && 10 <= m) && j <= 1) && i <= 1) && 10 <= n) || ((((66 <= k && 10 <= m) && i <= 6) && 10 <= n) && j <= 6)) || ((83 <= k && i <= 8) && (10 <= m && j <= 3) && 10 <= n)) || ((((10 <= m && 56 <= k) && i <= 5) && 10 <= n) && j <= 6)) || (((65 <= k && i <= 6) && 10 <= n) && j <= 5 && 10 <= m)) || ((((10 <= m && j <= 1) && i <= 6) && 61 <= k) && 10 <= n)) || ((((i <= 3 && 10 <= m) && j <= 2) && 32 <= k) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 4) && 43 <= k) && 10 <= n)) || ((((10 <= m && i <= 1) && 17 <= k) && j <= 7) && 10 <= n)) || ((((33 <= k && i <= 3) && 10 <= m) && j <= 3) && 10 <= n)) || (((86 <= k && 10 <= m && j <= 6) && i <= 8) && 10 <= n)) || (99 <= k && ((i + 1 <= n && 10 <= m) && j <= 9) && 10 <= n)) || (95 <= k && i + 1 <= n && 10 <= n && j <= 5 && 10 <= m)) || ((((69 <= k && 10 <= m) && j <= 9) && i <= 6) && 10 <= n)) || ((((2 <= k && 10 <= m) && j <= 2) && i <= 0) && 10 <= n)) || ((((10 <= m && 26 <= k) && i <= 2) && 10 <= n) && j <= 6)) || ((((10 <= m && j <= 4) && i <= 0) && 4 <= k) && 10 <= n)) || ((84 <= k && (10 <= m && j <= 4) && 10 <= n) && i <= 8)) || (((58 <= k && i <= 5) && 10 <= n) && j <= 8 && 10 <= m)) || (((50 <= k && i <= 5) && 10 <= m && j <= 0) && 10 <= n)) || (((i <= 7 && 77 <= k) && 10 <= n) && 10 <= m && j <= 7)) || (((40 <= k && i <= 4) && 10 <= m && j <= 0) && 10 <= n)) || (((60 <= k && 10 <= m && j <= 0) && i <= 6) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 45 <= k) && i <= 4) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 2) && 10 <= n) && 92 <= k)) || ((((16 <= k && 10 <= m) && i <= 1) && 10 <= n) && j <= 6)) || (((71 <= k && 10 <= m && j <= 1) && i <= 7) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 0) && 10 <= n) && 90 <= k)) || ((((i <= 3 && 10 <= m) && j <= 4) && 34 <= k) && 10 <= n)) || (((67 <= k && i <= 6) && 10 <= n) && 10 <= m && j <= 7)) || (((10 <= m && 10 <= k) && i <= 0) && 10 <= n)) || ((((j <= 8 && 28 <= k) && 10 <= m) && i <= 2) && 10 <= n)) || (((82 <= k && 10 <= m && j <= 2) && i <= 8) && 10 <= n)) || (((50 <= k && i <= 4) && 10 <= m) && 10 <= n)) || ((((10 <= m && 6 <= k) && i <= 0) && 10 <= n) && j <= 6)) || ((((21 <= k && 10 <= m) && j <= 1) && i <= 2) && 10 <= n)) || ((i + 1 <= n && 10 <= n && j <= 8 && 10 <= m) && 98 <= k)) || ((((i <= 3 && 10 <= m) && 39 <= k) && j <= 9) && 10 <= n)) || ((((89 <= k && 10 <= m) && i <= 8) && j <= 9) && 10 <= n)) || ((((10 <= m && 7 <= k) && j <= 7) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 1) && 13 <= k) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 1) && 10 <= n)) || (((i <= 4 && 10 <= m && j <= 7) && 47 <= k) && 10 <= n)) || (((10 <= n && j <= 5 && 10 <= m) && 85 <= k) && i <= 8)) || (((10 <= n && j <= 8 && 10 <= m) && i <= 8) && 88 <= k)) || (((i <= 5 && 10 <= m && j <= 7) && 10 <= n) && 57 <= k)) || (((81 <= k && i <= 8) && 10 <= m && j <= 1) && 10 <= n)) || (((i <= 3 && 10 <= m) && 40 <= k) && 10 <= n)) || (((70 <= k && 10 <= m) && i <= 6) && 10 <= n)) || (((10 <= m && 60 <= k) && i <= 5) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 7) && 10 <= n) && 97 <= k)) || ((((i <= 3 && 10 <= m) && j <= 1) && 10 <= n) && 31 <= k)) || ((((10 <= m && 22 <= k) && i <= 2) && j <= 2) && 10 <= n)) || ((i + 1 <= n && (10 <= m && j <= 3) && 10 <= n) && 93 <= k)) || ((((10 <= m && j <= 2) && i <= 4) && 42 <= k) && 10 <= n)) || ((((30 <= k && i <= 3) && 10 <= m) && j <= 0) && 10 <= n)) || (((10 <= n && j <= 5 && 10 <= m) && 75 <= k) && i <= 7)) || (((78 <= k && i <= 7) && 10 <= n) && j <= 8 && 10 <= m)) || (((80 <= k && 10 <= m) && i <= 7) && 10 <= n)) || ((54 <= k && (10 <= m && j <= 4) && 10 <= n) && i <= 5)) || ((((10 <= m && j <= 9) && i <= 7) && 79 <= k) && 10 <= n)) || ((((10 <= m && 29 <= k) && i <= 2) && j <= 9) && 10 <= n)) || ((((10 <= m && j <= 6) && i <= 7) && 10 <= n) && 76 <= k)) || ((((j <= 5 && 10 <= m) && 25 <= k) && i <= 2) && 10 <= n)) || ((((10 <= m && 0 <= k) && j <= 0) && i <= 0) && 10 <= n)) || ((((10 <= m && 10 <= k) && i <= 1) && j <= 0) && 10 <= n)) || ((((10 <= m && i <= 4) && j <= 4) && 44 <= k) && 10 <= n)) || (((53 <= k && 10 <= m && j <= 3) && i <= 5) && 10 <= n)) || ((((10 <= m && j <= 2) && i <= 7) && 72 <= k) && 10 <= n)) || (((10 <= m && i <= 8) && 10 <= n) && 90 <= k)) || ((((23 <= k && 10 <= m) && j <= 3) && i <= 2) && 10 <= n)) || ((((10 <= m && i <= 4) && j <= 9) && 49 <= k) && 10 <= n)) || (((63 <= k && 10 <= m && j <= 3) && i <= 6) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 4) && 10 <= n) && 24 <= k)) || ((((j <= 5 && 10 <= m) && 5 <= k) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 2) && i <= 5) && 52 <= k) && 10 <= n)) || ((((10 <= m && j <= 1) && i <= 0) && 10 <= n) && 1 <= k)) || (((30 <= k && 10 <= m) && i <= 2) && 10 <= n)) || ((((37 <= k && i <= 3) && 10 <= m) && j <= 7) && 10 <= n)) || ((((10 <= m && j <= 3) && 3 <= k) && i <= 0) && 10 <= n)) || ((((i <= 3 && 10 <= m) && 36 <= k) && 10 <= n) && j <= 6)) || (96 <= k && (i + 1 <= n && 10 <= m && j <= 6) && 10 <= n)) || ((((10 <= m && i <= 4) && 46 <= k) && 10 <= n) && j <= 6)) || ((((10 <= m && j <= 1) && i <= 5) && 10 <= n) && 51 <= k)) || ((((10 <= m && i <= 1) && j <= 2) && 12 <= k) && 10 <= n)) || ((((i <= 3 && j <= 5) && 10 <= m) && 35 <= k) && 10 <= n)) || ((((10 <= m && 20 <= k) && i <= 2) && j <= 0) && 10 <= n)) || (((i <= 4 && 48 <= k) && 10 <= n) && j <= 8 && 10 <= m)) || ((((10 <= m && i <= 1) && j <= 9) && 10 <= n) && 19 <= k)) || ((((j <= 5 && 10 <= m) && 15 <= k) && i <= 1) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 1) && 10 <= n) && 91 <= k)) || ((((j <= 8 && 10 <= m) && 8 <= k) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 7) && i <= 8) && 87 <= k) && 10 <= n)) || ((((10 <= m && j <= 2) && 62 <= k) && i <= 6) && 10 <= n)) || (((70 <= k && 10 <= m && j <= 0) && i <= 7) && 10 <= n)) || (100 <= k && (i + 1 <= n && 10 <= m) && 10 <= n)) || (((68 <= k && i <= 6) && 10 <= n) && j <= 8 && 10 <= m)) || ((((j <= 8 && 10 <= m) && 18 <= k) && i <= 1) && 10 <= n)) || ((((59 <= k && 10 <= m) && i <= 5) && j <= 9) && 10 <= n)) || (((80 <= k && i <= 8) && 10 <= m && j <= 0) && 10 <= n)) || ((i + 1 <= n && (10 <= m && j <= 4) && 10 <= n) && 94 <= k)) || ((((i <= 3 && j <= 8) && 10 <= m) && 38 <= k) && 10 <= n)) || ((((14 <= k && 10 <= m) && i <= 1) && j <= 4) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 7) && 10 <= n) && 73 <= k)) || ((((10 <= m && j <= 1) && i <= 4) && 41 <= k) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 7) && 10 <= n) && 27 <= k)) || ((((j <= 5 && 10 <= m) && 55 <= k) && i <= 5) && 10 <= n)) || ((64 <= k && (10 <= m && j <= 4) && 10 <= n) && i <= 6)) || ((((10 <= m && 9 <= k) && j <= 9) && i <= 0) && 10 <= n)) || ((74 <= k && (10 <= m && j <= 4) && 10 <= n) && i <= 7) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 167.8s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 152.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 1229 SDslu, 2447 SDs, 0 SdLazy, 1119 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1733 GetRequests, 1358 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred 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, 205 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 26 PreInvPairs, 5143 NumberOfFragments, 1976 HoareAnnotationTreeSize, 26 FomulaSimplifications, 6270176 FormulaSimplificationTreeSizeReduction, 72.6s HoareSimplificationTime, 8 FomulaSimplificationsInter, 103119 FormulaSimplificationTreeSizeReductionInter, 80.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3143 NumberOfCodeBlocks, 3098 NumberOfCodeBlocksAsserted, 230 NumberOfCheckSat, 3108 ConstructedInterpolants, 0 QuantifiedInterpolants, 2217884 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3486 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 23492/77270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...