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/loops/sum04-2.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:07:14,329 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:07:14,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:07:14,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:07:14,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:07:14,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:07:14,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:07:14,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:07:14,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:07:14,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:07:14,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:07:14,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:07:14,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:07:14,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:07:14,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:07:14,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:07:14,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:07:14,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:07:14,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:07:14,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:07:14,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:07:14,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:07:14,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:07:14,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:07:14,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:07:14,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:07:14,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:07:14,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:07:14,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:07:14,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:07:14,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:07:14,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:07:14,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:07:14,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:07:14,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:07:14,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:07:14,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:07:14,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:07:14,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:07:14,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:07:14,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:07:14,378 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-10-13 21:07:14,393 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:07:14,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:07:14,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:07:14,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:07:14,394 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:07:14,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:07:14,395 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:07:14,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:07:14,395 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:07:14,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:07:14,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:07:14,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:07:14,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:07:14,396 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:07:14,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:07:14,397 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:07:14,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:07:14,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:07:14,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:07:14,397 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:07:14,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:07:14,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:07:14,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:07:14,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:07:14,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:07:14,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:07:14,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:07:14,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:07:14,399 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-10-13 21:07:14,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:07:14,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:07:14,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:07:14,735 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:07:14,737 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:07:14,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i
[2019-10-13 21:07:14,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ad1bc1/5ac8a13353154827b711a30b5f6eafae/FLAG31ee45330
[2019-10-13 21:07:15,294 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:07:15,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i
[2019-10-13 21:07:15,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ad1bc1/5ac8a13353154827b711a30b5f6eafae/FLAG31ee45330
[2019-10-13 21:07:15,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d4ad1bc1/5ac8a13353154827b711a30b5f6eafae
[2019-10-13 21:07:15,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:07:15,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:07:15,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:07:15,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:07:15,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:07:15,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:15,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fc59ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15, skipping insertion in model container
[2019-10-13 21:07:15,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:15,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:07:15,716 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:07:15,884 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:07:15,889 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:07:15,905 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:07:15,923 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:07:15,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15 WrapperNode
[2019-10-13 21:07:15,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:07:15,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:07:15,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:07:15,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:07:16,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (1/1) ...
[2019-10-13 21:07:16,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:07:16,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:07:16,049 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:07:16,049 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:07:16,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (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-10-13 21:07:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:07:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:07:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2019-10-13 21:07:16,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2019-10-13 21:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:07:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:07:16,262 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:07:16,262 INFO L284 CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-13 21:07:16,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:16 BoogieIcfgContainer
[2019-10-13 21:07:16,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:07:16,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:07:16,265 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:07:16,269 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:07:16,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:07:15" (1/3) ...
[2019-10-13 21:07:16,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62acde97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:16, skipping insertion in model container
[2019-10-13 21:07:16,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:15" (2/3) ...
[2019-10-13 21:07:16,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62acde97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:16, skipping insertion in model container
[2019-10-13 21:07:16,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:16" (3/3) ...
[2019-10-13 21:07:16,272 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i
[2019-10-13 21:07:16,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:07:16,290 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:07:16,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:07:16,326 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:07:16,326 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:07:16,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:07:16,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:07:16,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:07:16,327 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:07:16,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:07:16,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:07:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states.
[2019-10-13 21:07:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 21:07:16,349 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:16,350 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:16,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times
[2019-10-13 21:07:16,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:16,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000407138]
[2019-10-13 21:07:16,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:16,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000407138]
[2019-10-13 21:07:16,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:07:16,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-10-13 21:07:16,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7314933]
[2019-10-13 21:07:16,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 21:07:16,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 21:07:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:07:16,478 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states.
[2019-10-13 21:07:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:16,501 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions.
[2019-10-13 21:07:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2019-10-13 21:07:16,503 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2019-10-13 21:07:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:16,511 INFO L225 Difference]: With dead ends: 29
[2019-10-13 21:07:16,512 INFO L226 Difference]: Without dead ends: 12
[2019-10-13 21:07:16,515 INFO L600 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-10-13 21:07:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states.
[2019-10-13 21:07:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2019-10-13 21:07:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2019-10-13 21:07:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2019-10-13 21:07:16,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10
[2019-10-13 21:07:16,557 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:16,558 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2019-10-13 21:07:16,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 21:07:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2019-10-13 21:07:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 21:07:16,559 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:16,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:16,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times
[2019-10-13 21:07:16,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:16,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345935796]
[2019-10-13 21:07:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:16,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345935796]
[2019-10-13 21:07:16,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:07:16,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:07:16,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745690904]
[2019-10-13 21:07:16,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:07:16,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:07:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:07:16,610 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states.
[2019-10-13 21:07:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:16,662 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions.
[2019-10-13 21:07:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:07:16,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2019-10-13 21:07:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:16,664 INFO L225 Difference]: With dead ends: 19
[2019-10-13 21:07:16,664 INFO L226 Difference]: Without dead ends: 14
[2019-10-13 21:07:16,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:07:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2019-10-13 21:07:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13.
[2019-10-13 21:07:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2019-10-13 21:07:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2019-10-13 21:07:16,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10
[2019-10-13 21:07:16,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:16,672 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2019-10-13 21:07:16,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:07:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2019-10-13 21:07:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-10-13 21:07:16,673 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:16,673 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:16,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times
[2019-10-13 21:07:16,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:16,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123216245]
[2019-10-13 21:07:16,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:16,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:16,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123216245]
[2019-10-13 21:07:16,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576925886]
[2019-10-13 21:07:16,776 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-10-13 21:07:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:16,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-10-13 21:07:16,849 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:07:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:16,879 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:07:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:16,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2092119984]
[2019-10-13 21:07:16,944 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 13
[2019-10-13 21:07:16,975 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:07:16,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:07:17,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2019-10-13 21:07:17,085 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 2 different actions 12 times. Widened at 1 different actions 2 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 5. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 3 variables.
[2019-10-13 21:07:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:17,090 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2019-10-13 21:07:17,090 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:07:17,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2019-10-13 21:07:17,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342844538]
[2019-10-13 21:07:17,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 21:07:17,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 21:07:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:07:17,093 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states.
[2019-10-13 21:07:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:17,156 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions.
[2019-10-13 21:07:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:07:17,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12
[2019-10-13 21:07:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:17,158 INFO L225 Difference]: With dead ends: 24
[2019-10-13 21:07:17,158 INFO L226 Difference]: Without dead ends: 19
[2019-10-13 21:07:17,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:07:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2019-10-13 21:07:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2019-10-13 21:07:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2019-10-13 21:07:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions.
[2019-10-13 21:07:17,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12
[2019-10-13 21:07:17,164 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:17,165 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions.
[2019-10-13 21:07:17,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 21:07:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions.
[2019-10-13 21:07:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 21:07:17,166 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:17,166 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:17,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:07:17,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 2 times
[2019-10-13 21:07:17,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:17,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144040810]
[2019-10-13 21:07:17,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:17,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:17,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:17,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144040810]
[2019-10-13 21:07:17,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149629711]
[2019-10-13 21:07:17,488 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
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-10-13 21:07:17,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2019-10-13 21:07:17,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-10-13 21:07:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-10-13 21:07:17,528 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:07:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:17,546 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:07:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:17,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [815124789]
[2019-10-13 21:07:17,642 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-10-13 21:07:17,642 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-10-13 21:07:17,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:07:17,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10
[2019-10-13 21:07:17,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381337921]
[2019-10-13 21:07:17,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-13 21:07:17,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-13 21:07:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2019-10-13 21:07:17,645 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states.
[2019-10-13 21:07:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:17,699 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions.
[2019-10-13 21:07:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-10-13 21:07:17,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18
[2019-10-13 21:07:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:17,702 INFO L225 Difference]: With dead ends: 32
[2019-10-13 21:07:17,702 INFO L226 Difference]: Without dead ends: 27
[2019-10-13 21:07:17,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90
[2019-10-13 21:07:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2019-10-13 21:07:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2019-10-13 21:07:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2019-10-13 21:07:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions.
[2019-10-13 21:07:17,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 18
[2019-10-13 21:07:17,709 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:17,709 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions.
[2019-10-13 21:07:17,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-10-13 21:07:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions.
[2019-10-13 21:07:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 21:07:17,711 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:17,711 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:17,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:07:17,912 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 3 times
[2019-10-13 21:07:17,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:17,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555931111]
[2019-10-13 21:07:17,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:17,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:17,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:18,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555931111]
[2019-10-13 21:07:18,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992364806]
[2019-10-13 21:07:18,200 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
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-10-13 21:07:18,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2019-10-13 21:07:18,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-10-13 21:07:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core
[2019-10-13 21:07:18,243 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:07:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 21:07:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:18,337 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:07:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:18,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [444505725]
[2019-10-13 21:07:18,616 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-10-13 21:07:18,616 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-10-13 21:07:18,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:07:18,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24
[2019-10-13 21:07:18,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036178136]
[2019-10-13 21:07:18,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states
[2019-10-13 21:07:18,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2019-10-13 21:07:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552
[2019-10-13 21:07:18,624 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states.
[2019-10-13 21:07:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:18,801 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions.
[2019-10-13 21:07:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 21:07:18,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26
[2019-10-13 21:07:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:18,803 INFO L225 Difference]: With dead ends: 34
[2019-10-13 21:07:18,803 INFO L226 Difference]: Without dead ends: 29
[2019-10-13 21:07:18,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600
[2019-10-13 21:07:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2019-10-13 21:07:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2019-10-13 21:07:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2019-10-13 21:07:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions.
[2019-10-13 21:07:18,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26
[2019-10-13 21:07:18,810 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:18,810 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions.
[2019-10-13 21:07:18,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2019-10-13 21:07:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions.
[2019-10-13 21:07:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2019-10-13 21:07:18,813 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:07:18,813 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:07:19,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:07:19,019 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:07:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:07:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 4 times
[2019-10-13 21:07:19,020 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:07:19,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534824204]
[2019-10-13 21:07:19,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:19,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:07:19,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:07:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:07:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:07:19,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534824204]
[2019-10-13 21:07:19,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:07:19,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2019-10-13 21:07:19,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521022776]
[2019-10-13 21:07:19,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-13 21:07:19,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:07:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-13 21:07:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2019-10-13 21:07:19,137 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states.
[2019-10-13 21:07:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:07:19,174 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions.
[2019-10-13 21:07:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-10-13 21:07:19,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28
[2019-10-13 21:07:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:07:19,175 INFO L225 Difference]: With dead ends: 29
[2019-10-13 21:07:19,176 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 21:07:19,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2019-10-13 21:07:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:07:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:07:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:07:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:07:19,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28
[2019-10-13 21:07:19,177 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:07:19,178 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:07:19,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-13 21:07:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:07:19,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:07:19,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:07:19,426 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62
[2019-10-13 21:07:19,428 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2019-10-13 21:07:19,428 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:07:19,428 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:07:19,429 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 21:07:19,429 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:07:19,429 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:07:19,429 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true
[2019-10-13 21:07:19,429 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed.
[2019-10-13 21:07:19,429 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed.
[2019-10-13 21:07:19,429 INFO L443 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed.
[2019-10-13 21:07:19,430 INFO L439 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 7 main_~i~0) (< main_~i~0 8) (<= 12 main_~sn~0) (<= main_~sn~0 12)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 10 main_~sn~0) (< main_~i~0 7) (<= 6 main_~i~0) (<= main_~sn~0 10)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)))
[2019-10-13 21:07:19,430 INFO L439 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0))
[2019-10-13 21:07:19,430 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true
[2019-10-13 21:07:19,430 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed.
[2019-10-13 21:07:19,430 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed.
[2019-10-13 21:07:19,431 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed.
[2019-10-13 21:07:19,431 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed.
[2019-10-13 21:07:19,431 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed.
[2019-10-13 21:07:19,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:07:19 BoogieIcfgContainer
[2019-10-13 21:07:19,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:07:19,450 INFO L168 Benchmark]: Toolchain (without parser) took 3768.93 ms. Allocated memory was 145.2 MB in the beginning and 244.8 MB in the end (delta: 99.6 MB). Free memory was 102.1 MB in the beginning and 206.0 MB in the end (delta: -104.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,451 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.74 ms. Allocated memory is still 145.2 MB. Free memory was 101.9 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,453 INFO L168 Benchmark]: Boogie Preprocessor took 123.23 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.2 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,453 INFO L168 Benchmark]: RCFGBuilder took 215.64 ms. Allocated memory is still 201.9 MB. Free memory was 180.2 MB in the beginning and 169.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,455 INFO L168 Benchmark]: TraceAbstraction took 3182.37 ms. Allocated memory was 201.9 MB in the beginning and 244.8 MB in the end (delta: 43.0 MB). Free memory was 169.8 MB in the beginning and 206.0 MB in the end (delta: -36.2 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB.
[2019-10-13 21:07:19,459 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.25 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 242.74 ms. Allocated memory is still 145.2 MB. Free memory was 101.9 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 123.23 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.2 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 215.64 ms. Allocated memory is still 201.9 MB. Free memory was 180.2 MB in the beginning and 169.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 3182.37 ms. Allocated memory was 201.9 MB in the beginning and 244.8 MB in the end (delta: 43.0 MB). Free memory was 169.8 MB in the beginning and 206.0 MB in the end (delta: -36.2 MB). Peak memory consumption was 123.1 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: 13]: Loop Invariant
Derived loop invariant: ((((((((((1 <= i && i <= 1) && sn <= 0) && 0 <= sn) || (((7 <= i && i < 8) && 12 <= sn) && sn <= 12)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((10 <= sn && i < 7) && 6 <= i) && sn <= 10)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 18 locations, 1 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 9, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 70 SDtfs, 15 SDslu, 310 SDs, 0 SdLazy, 250 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 127 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 15298 SizeOfPredicates, 4 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 81/324 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...