/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:21,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:21,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:21,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:21,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:21,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:21,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:21,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:21,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:21,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:21,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:21,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:21,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:21,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:21,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:21,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:21,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:21,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:21,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:21,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:21,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:21,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:21,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:21,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:21,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:21,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:21,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:21,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:21,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:21,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:21,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:21,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:21,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:21,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:21,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:21,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:21,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:21,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:21,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:21,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:21,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:21,500 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-11-07 00:34:21,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:21,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:21,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:21,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:21,515 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:21,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:21,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:21,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:21,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:21,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:21,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:21,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:21,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:21,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:21,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:21,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:21,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:21,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:21,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:21,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:21,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:21,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:21,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:21,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:21,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:21,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:21,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:21,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:21,841 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:21,842 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-11-07 00:34:21,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa449d8e/60d95635ce904b789a77ae0766ef1768/FLAG0ea49b7a0 [2019-11-07 00:34:22,372 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:22,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2019-11-07 00:34:22,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa449d8e/60d95635ce904b789a77ae0766ef1768/FLAG0ea49b7a0 [2019-11-07 00:34:22,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa449d8e/60d95635ce904b789a77ae0766ef1768 [2019-11-07 00:34:22,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:22,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:22,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:22,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:22,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:22,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:22" (1/1) ... [2019-11-07 00:34:22,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f087c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:22, skipping insertion in model container [2019-11-07 00:34:22,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:22" (1/1) ... [2019-11-07 00:34:22,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:22,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:23,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:23,025 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:23,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:23,056 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23 WrapperNode [2019-11-07 00:34:23,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:23,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:23,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:23,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:23,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... [2019-11-07 00:34:23,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:23,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:23,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:23,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:23,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:34:23,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:23,462 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:23,462 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 00:34:23,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:23 BoogieIcfgContainer [2019-11-07 00:34:23,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:23,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:23,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:23,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:23,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:22" (1/3) ... [2019-11-07 00:34:23,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb0fa65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:23, skipping insertion in model container [2019-11-07 00:34:23,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:23" (2/3) ... [2019-11-07 00:34:23,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb0fa65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:23, skipping insertion in model container [2019-11-07 00:34:23,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:23" (3/3) ... [2019-11-07 00:34:23,472 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2019-11-07 00:34:23,482 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:23,490 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:34:23,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:34:23,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:23,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:23,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:23,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:23,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:23,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:23,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:23,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-07 00:34:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:34:23,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:23,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:23,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 576145336, now seen corresponding path program 1 times [2019-11-07 00:34:23,635 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:23,635 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025303086] [2019-11-07 00:34:23,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:23,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025303086] [2019-11-07 00:34:23,754 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:23,755 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:34:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188696954] [2019-11-07 00:34:23,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:34:23,764 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:34:23,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:34:23,782 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-07 00:34:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:23,804 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-07 00:34:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:34:23,805 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-11-07 00:34:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:23,814 INFO L225 Difference]: With dead ends: 40 [2019-11-07 00:34:23,814 INFO L226 Difference]: Without dead ends: 20 [2019-11-07 00:34:23,817 INFO L630 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-11-07 00:34:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-07 00:34:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-07 00:34:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-07 00:34:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-07 00:34:23,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-11-07 00:34:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:23,857 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-07 00:34:23,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:34:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-07 00:34:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:34:23,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:23,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:23,859 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash 893444581, now seen corresponding path program 1 times [2019-11-07 00:34:23,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:23,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561826205] [2019-11-07 00:34:23,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:23,964 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561826205] [2019-11-07 00:34:23,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:23,964 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:23,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666446059] [2019-11-07 00:34:23,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:23,967 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:23,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:23,968 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-11-07 00:34:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:24,047 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-07 00:34:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:24,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-07 00:34:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:24,049 INFO L225 Difference]: With dead ends: 32 [2019-11-07 00:34:24,049 INFO L226 Difference]: Without dead ends: 21 [2019-11-07 00:34:24,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-07 00:34:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-07 00:34:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-07 00:34:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-07 00:34:24,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2019-11-07 00:34:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:24,057 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-07 00:34:24,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-07 00:34:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:24,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:24,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:24,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash -884671747, now seen corresponding path program 1 times [2019-11-07 00:34:24,060 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:24,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872851154] [2019-11-07 00:34:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:24,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872851154] [2019-11-07 00:34:24,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103784280] [2019-11-07 00:34:24,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:24,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:24,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:24,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:24,360 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:24,426 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1193577512] [2019-11-07 00:34:24,432 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 17 [2019-11-07 00:34:24,473 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:24,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:24,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:24,573 INFO L272 AbstractInterpreter]: Visited 16 different actions 20 times. Merged at 3 different actions 3 times. Never widened. Performed 41 root evaluator evaluations with a maximum evaluation depth of 5. Performed 41 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2019-11-07 00:34:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:24,578 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:24,578 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:24,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-11-07 00:34:24,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198125674] [2019-11-07 00:34:24,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:34:24,580 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:34:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:24,581 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 13 states. [2019-11-07 00:34:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:24,824 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-11-07 00:34:24,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:34:24,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-11-07 00:34:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:24,827 INFO L225 Difference]: With dead ends: 47 [2019-11-07 00:34:24,827 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 00:34:24,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:34:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 00:34:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2019-11-07 00:34:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:34:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-07 00:34:24,851 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 16 [2019-11-07 00:34:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:24,854 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-07 00:34:24,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:34:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-07 00:34:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:24,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:24,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:25,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:25,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash 213378718, now seen corresponding path program 1 times [2019-11-07 00:34:25,058 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:25,058 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503275278] [2019-11-07 00:34:25,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:25,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503275278] [2019-11-07 00:34:25,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965228500] [2019-11-07 00:34:25,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:25,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:25,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:25,263 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:25,330 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1626737221] [2019-11-07 00:34:25,330 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-11-07 00:34:25,337 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:25,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:25,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:25,383 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 5. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2019-11-07 00:34:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:25,384 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:25,384 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:25,384 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-11-07 00:34:25,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811191060] [2019-11-07 00:34:25,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:34:25,388 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:25,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:34:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:25,389 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 13 states. [2019-11-07 00:34:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:25,578 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-11-07 00:34:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:34:25,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-07 00:34:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:25,583 INFO L225 Difference]: With dead ends: 60 [2019-11-07 00:34:25,583 INFO L226 Difference]: Without dead ends: 58 [2019-11-07 00:34:25,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:34:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-07 00:34:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2019-11-07 00:34:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 00:34:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-07 00:34:25,604 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 17 [2019-11-07 00:34:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:25,605 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-07 00:34:25,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:34:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-11-07 00:34:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:25,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:25,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:25,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:25,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash -595967908, now seen corresponding path program 1 times [2019-11-07 00:34:25,820 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:25,820 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992084655] [2019-11-07 00:34:25,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:25,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992084655] [2019-11-07 00:34:25,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048956553] [2019-11-07 00:34:25,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:25,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:25,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:25,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:25,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-11-07 00:34:25,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:26,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1199609870] [2019-11-07 00:34:26,025 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-11-07 00:34:26,028 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:26,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:26,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:26,063 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Performed 43 root evaluator evaluations with a maximum evaluation depth of 5. Performed 43 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2019-11-07 00:34:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:26,063 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:26,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:26,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-11-07 00:34:26,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147734480] [2019-11-07 00:34:26,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:34:26,065 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:34:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:26,066 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 13 states. [2019-11-07 00:34:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:26,261 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-11-07 00:34:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:34:26,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-07 00:34:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:26,263 INFO L225 Difference]: With dead ends: 64 [2019-11-07 00:34:26,263 INFO L226 Difference]: Without dead ends: 62 [2019-11-07 00:34:26,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:34:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-07 00:34:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2019-11-07 00:34:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-07 00:34:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2019-11-07 00:34:26,281 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2019-11-07 00:34:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:26,281 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-11-07 00:34:26,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:34:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2019-11-07 00:34:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:26,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:26,283 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:26,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:26,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1650045878, now seen corresponding path program 1 times [2019-11-07 00:34:26,492 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:26,492 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309059812] [2019-11-07 00:34:26,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:26,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309059812] [2019-11-07 00:34:26,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580748113] [2019-11-07 00:34:26,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:26,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:34:26,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:26,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:26,810 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:34:26,811 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 15 [2019-11-07 00:34:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472617719] [2019-11-07 00:34:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:26,812 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:26,812 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 5 states. [2019-11-07 00:34:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:26,831 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2019-11-07 00:34:26,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:26,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-07 00:34:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:26,833 INFO L225 Difference]: With dead ends: 67 [2019-11-07 00:34:26,833 INFO L226 Difference]: Without dead ends: 32 [2019-11-07 00:34:26,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-07 00:34:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-07 00:34:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 00:34:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-07 00:34:26,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2019-11-07 00:34:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:26,841 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-07 00:34:26,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-07 00:34:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:34:26,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:26,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:27,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:27,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1617331331, now seen corresponding path program 1 times [2019-11-07 00:34:27,049 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,049 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839948804] [2019-11-07 00:34:27,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 00:34:27,195 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839948804] [2019-11-07 00:34:27,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791881622] [2019-11-07 00:34:27,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:34:27,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 00:34:27,285 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 00:34:27,332 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:34:27,332 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 15 [2019-11-07 00:34:27,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565928914] [2019-11-07 00:34:27,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:34:27,334 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:34:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:27,334 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-11-07 00:34:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:27,360 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-07 00:34:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:27,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-07 00:34:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:27,361 INFO L225 Difference]: With dead ends: 34 [2019-11-07 00:34:27,361 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:27,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:34:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:27,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-07 00:34:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:27,363 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:27,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:34:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:27,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:27,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:27,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:27,857 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:34:27,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:27,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:27,858 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:27,858 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:27,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:27,858 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-11-07 00:34:27,858 INFO L443 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2019-11-07 00:34:27,859 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2019-11-07 00:34:27,859 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-11-07 00:34:27,859 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-07 00:34:27,859 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2019-11-07 00:34:27,859 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) .cse0 (and .cse1 (and .cse2 .cse3 (<= 2000 main_~k~0))) .cse4) (and .cse1 .cse2 .cse3 .cse0 (<= 1 main_~j~0) .cse4 (< 0 main_~k~0)))) [2019-11-07 00:34:27,860 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2019-11-07 00:34:27,860 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2019-11-07 00:34:27,860 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-07 00:34:27,860 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-07 00:34:27,860 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 (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0)) (< main_~n~0 2)) (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)))) [2019-11-07 00:34:27,860 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2019-11-07 00:34:27,860 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:34:27,861 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:27,861 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:34:27,861 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:34:27,861 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:34:27,861 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:27,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:27 BoogieIcfgContainer [2019-11-07 00:34:27,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:27,885 INFO L168 Benchmark]: Toolchain (without parser) took 5093.91 ms. Allocated memory was 143.7 MB in the beginning and 248.0 MB in the end (delta: 104.3 MB). Free memory was 101.8 MB in the beginning and 114.5 MB in the end (delta: -12.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,888 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.87 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,891 INFO L168 Benchmark]: Boogie Preprocessor took 121.87 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.9 MB in the beginning and 179.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,895 INFO L168 Benchmark]: RCFGBuilder took 284.59 ms. Allocated memory is still 200.8 MB. Free memory was 179.0 MB in the beginning and 165.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,896 INFO L168 Benchmark]: TraceAbstraction took 4416.88 ms. Allocated memory was 200.8 MB in the beginning and 248.0 MB in the end (delta: 47.2 MB). Free memory was 164.3 MB in the beginning and 114.5 MB in the end (delta: 49.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:27,909 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.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.87 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.87 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.9 MB in the beginning and 179.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 284.59 ms. Allocated memory is still 200.8 MB. Free memory was 179.0 MB in the beginning and 165.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4416.88 ms. Allocated memory was 200.8 MB in the beginning and 248.0 MB in the end (delta: 47.2 MB). Free memory was 164.3 MB in the beginning and 114.5 MB in the end (delta: 49.8 MB). Peak memory consumption was 97.0 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: (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) && n < 2) || (((((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) && 0 < k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 171 SDtfs, 164 SDslu, 581 SDs, 0 SdLazy, 338 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 21 NumberOfFragments, 126 HoareAnnotationTreeSize, 15 FomulaSimplifications, 308 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 83 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 15896 SizeOfPredicates, 13 NumberOfNonLiveVariables, 358 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 54/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...