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-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:18,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:18,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:18,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:18,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:18,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:18,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:18,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:18,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:18,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:18,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:18,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:18,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:18,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:18,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:18,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:18,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:18,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:18,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:18,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:18,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:18,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:18,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:18,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:18,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:18,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:18,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:18,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:18,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:18,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:18,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:18,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:18,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:18,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:18,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:18,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:18,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:18,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:18,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:18,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:18,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:18,492 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-20 12:58:18,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:18,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:18,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:18,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:18,508 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:18,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:18,508 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:18,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:18,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:18,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:18,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:18,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:18,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:18,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:18,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:18,510 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:18,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:18,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:18,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:18,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:18,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:18,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:18,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:18,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:18,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:18,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:18,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:18,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:18,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:18,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:18,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:18,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:18,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:18,558 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:18,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2019-09-20 12:58:18,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e2739b/e6718ce94dca4985bae38d2e5bc0cccf/FLAG901ea86dc [2019-09-20 12:58:19,044 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:19,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2019-09-20 12:58:19,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e2739b/e6718ce94dca4985bae38d2e5bc0cccf/FLAG901ea86dc [2019-09-20 12:58:19,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e2739b/e6718ce94dca4985bae38d2e5bc0cccf [2019-09-20 12:58:19,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:19,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:19,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:19,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:19,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:19,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14205edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19, skipping insertion in model container [2019-09-20 12:58:19,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:19,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:19,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:19,689 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:19,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:19,716 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:19,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19 WrapperNode [2019-09-20 12:58:19,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:19,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:19,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:19,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:19,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (1/1) ... [2019-09-20 12:58:19,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:19,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:19,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:19,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:19,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (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-20 12:58:19,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:19,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:19,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:58:19,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:19,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:20,093 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:20,093 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 12:58:20,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:20 BoogieIcfgContainer [2019-09-20 12:58:20,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:20,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:20,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:20,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:20,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:19" (1/3) ... [2019-09-20 12:58:20,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a75a1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:20, skipping insertion in model container [2019-09-20 12:58:20,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:19" (2/3) ... [2019-09-20 12:58:20,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a75a1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:20, skipping insertion in model container [2019-09-20 12:58:20,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:20" (3/3) ... [2019-09-20 12:58:20,105 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2019-09-20 12:58:20,117 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:20,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:58:20,141 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:58:20,169 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:20,170 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:20,170 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:20,170 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:20,170 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:20,170 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:20,171 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:20,171 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:20,171 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-20 12:58:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 12:58:20,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:20,193 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:20,195 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash 576145336, now seen corresponding path program 1 times [2019-09-20 12:58:20,201 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:20,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,308 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-20 12:58:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:58:20,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:58:20,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:58:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:58:20,327 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-20 12:58:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:20,351 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-09-20 12:58:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:58:20,352 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-20 12:58:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:20,362 INFO L225 Difference]: With dead ends: 40 [2019-09-20 12:58:20,362 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 12:58:20,366 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:58:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 12:58:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-20 12:58:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-20 12:58:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-20 12:58:20,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-09-20 12:58:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:20,409 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-20 12:58:20,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:58:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-20 12:58:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 12:58:20,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:20,411 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:20,411 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash 893444581, now seen corresponding path program 1 times [2019-09-20 12:58:20,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:20,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,588 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-20 12:58:20,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:20,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:20,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:20,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:20,598 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-09-20 12:58:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:20,677 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-20 12:58:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:20,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-20 12:58:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:20,678 INFO L225 Difference]: With dead ends: 32 [2019-09-20 12:58:20,679 INFO L226 Difference]: Without dead ends: 21 [2019-09-20 12:58:20,680 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-20 12:58:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-20 12:58:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 12:58:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-20 12:58:20,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2019-09-20 12:58:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:20,687 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-20 12:58:20,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-20 12:58:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:58:20,688 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:20,688 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:20,689 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash -884671747, now seen corresponding path program 1 times [2019-09-20 12:58:20,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:20,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:20,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:20,819 INFO L224 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-20 12:58:20,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:58:20,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:20,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:20,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:20,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-20 12:58:20,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:58:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:58:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:20,980 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-09-20 12:58:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:21,139 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-09-20 12:58:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:21,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-20 12:58:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:21,144 INFO L225 Difference]: With dead ends: 41 [2019-09-20 12:58:21,145 INFO L226 Difference]: Without dead ends: 39 [2019-09-20 12:58:21,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-20 12:58:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-20 12:58:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-20 12:58:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-20 12:58:21,168 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2019-09-20 12:58:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:21,169 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-20 12:58:21,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:58:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-20 12:58:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 12:58:21,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,170 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,171 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash 213378718, now seen corresponding path program 1 times [2019-09-20 12:58:21,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:21,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:21,275 INFO L224 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) [2019-09-20 12:58:21,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:58:21,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:21,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:21,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:21,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-20 12:58:21,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:58:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:58:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:21,365 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 10 states. [2019-09-20 12:58:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:21,505 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2019-09-20 12:58:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:21,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-09-20 12:58:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:21,509 INFO L225 Difference]: With dead ends: 51 [2019-09-20 12:58:21,509 INFO L226 Difference]: Without dead ends: 49 [2019-09-20 12:58:21,510 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-20 12:58:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-09-20 12:58:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 12:58:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-09-20 12:58:21,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 17 [2019-09-20 12:58:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:21,519 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-09-20 12:58:21,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:58:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-09-20 12:58:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 12:58:21,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,521 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,521 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash -595967908, now seen corresponding path program 1 times [2019-09-20 12:58:21,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:21,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:21,610 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:21,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:58:21,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:21,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:21,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-20 12:58:21,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:58:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:58:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:21,720 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 10 states. [2019-09-20 12:58:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:21,818 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-20 12:58:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:21,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-09-20 12:58:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:21,820 INFO L225 Difference]: With dead ends: 55 [2019-09-20 12:58:21,820 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 12:58:21,821 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 12:58:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-09-20 12:58:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 12:58:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-09-20 12:58:21,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2019-09-20 12:58:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:21,830 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-09-20 12:58:21,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:58:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-09-20 12:58:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:58:21,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,831 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,831 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1650045878, now seen corresponding path program 1 times [2019-09-20 12:58:21,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:21,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:21,973 INFO L224 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-20 12:58:22,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:58:22,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-20 12:58:22,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:58:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:58:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:58:22,081 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 14 states. [2019-09-20 12:58:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,262 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-09-20 12:58:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:58:22,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-20 12:58:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,264 INFO L225 Difference]: With dead ends: 65 [2019-09-20 12:58:22,264 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 12:58:22,265 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:58:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 12:58:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-09-20 12:58:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 12:58:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-20 12:58:22,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-09-20 12:58:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,272 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-20 12:58:22,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:58:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-20 12:58:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 12:58:22,273 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,273 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,273 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -785465255, now seen corresponding path program 1 times [2019-09-20 12:58:22,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:58:22,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:22,373 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:22,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:58:22,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:22,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-20 12:58:22,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:58:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:58:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:22,482 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 13 states. [2019-09-20 12:58:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,747 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-20 12:58:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 12:58:22,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-09-20 12:58:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,748 INFO L225 Difference]: With dead ends: 39 [2019-09-20 12:58:22,748 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:22,749 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-09-20 12:58:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:22,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-20 12:58:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,750 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:22,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:58:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:22,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:22,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:23,151 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2019-09-20 12:58:23,154 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 12:58:23,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:23,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:23,154 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:58:23,154 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:23,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:23,155 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 10000 main_~c3~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (< main_~n~0 2) (<= 2000 main_~k~0)) [2019-09-20 12:58:23,155 INFO L443 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2019-09-20 12:58:23,155 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2019-09-20 12:58:23,155 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-09-20 12:58:23,155 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-20 12:58:23,155 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2019-09-20 12:58:23,156 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 32 36) the Hoare annotation is: (let ((.cse1 (<= 10000 main_~c3~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= 4000 main_~c1~0)) (.cse0 (<= 1 main_~i~0)) (.cse4 (< main_~n~0 2))) (or (and (<= main_~n~0 0) (<= main_~i~0 0) (<= main_~n~0 main_~j~0)) (and (<= 0 main_~j~0) (and .cse0 (and .cse1 (and .cse2 .cse3 (<= 2000 main_~k~0))) .cse4)) (and .cse1 .cse2 .cse3 .cse0 (<= 1 main_~j~0) .cse4))) [2019-09-20 12:58:23,156 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2019-09-20 12:58:23,156 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2019-09-20 12:58:23,156 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-09-20 12:58:23,156 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-09-20 12:58:23,156 INFO L439 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 4000 main_~c1~0))) (or (and (< main_~n~0 2) (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0))) (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)))) [2019-09-20 12:58:23,156 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2019-09-20 12:58:23,157 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-20 12:58:23,157 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:23,157 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-20 12:58:23,157 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-20 12:58:23,157 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-20 12:58:23,157 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:23,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:58:23 BoogieIcfgContainer [2019-09-20 12:58:23,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:58:23,177 INFO L168 Benchmark]: Toolchain (without parser) took 3724.05 ms. Allocated memory was 132.1 MB in the beginning and 262.7 MB in the end (delta: 130.5 MB). Free memory was 86.8 MB in the beginning and 145.4 MB in the end (delta: -58.6 MB). Peak memory consumption was 71.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,178 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.21 ms. Allocated memory is still 132.1 MB. Free memory was 86.6 MB in the beginning and 76.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,179 INFO L168 Benchmark]: Boogie Preprocessor took 127.19 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 76.9 MB in the beginning and 176.1 MB in the end (delta: -99.2 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,180 INFO L168 Benchmark]: RCFGBuilder took 250.96 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 161.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,181 INFO L168 Benchmark]: TraceAbstraction took 3078.58 ms. Allocated memory was 199.8 MB in the beginning and 262.7 MB in the end (delta: 62.9 MB). Free memory was 161.1 MB in the beginning and 145.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:23,185 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.21 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.21 ms. Allocated memory is still 132.1 MB. Free memory was 86.6 MB in the beginning and 76.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.19 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 76.9 MB in the beginning and 176.1 MB in the end (delta: -99.2 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 250.96 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 161.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3078.58 ms. Allocated memory was 199.8 MB in the beginning and 262.7 MB in the end (delta: 62.9 MB). Free memory was 161.1 MB in the beginning and 145.4 MB in the end (delta: 15.7 MB). Peak memory consumption was 78.6 MB. 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: 20]: Loop Invariant Derived loop invariant: (n < 2 && (((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 0 <= i) && 0 <= k) && i <= 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 0) && n <= j) || (0 <= j && (1 <= i && 10000 <= c3 && (2000 <= c2 && 4000 <= c1) && 2000 <= k) && n < 2)) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 1 <= j) && n < 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 160 SDtfs, 176 SDslu, 631 SDs, 0 SdLazy, 425 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 24 NumberOfFragments, 125 HoareAnnotationTreeSize, 14 FomulaSimplifications, 498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 574 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 9943 SizeOfPredicates, 12 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 13/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...