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/array-tiling/pr5.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 19:53:57,000 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 19:53:57,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 19:53:57,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 19:53:57,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 19:53:57,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 19:53:57,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 19:53:57,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 19:53:57,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 19:53:57,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 19:53:57,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 19:53:57,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 19:53:57,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 19:53:57,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 19:53:57,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 19:53:57,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 19:53:57,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 19:53:57,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 19:53:57,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 19:53:57,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 19:53:57,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 19:53:57,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 19:53:57,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 19:53:57,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 19:53:57,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 19:53:57,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 19:53:57,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 19:53:57,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 19:53:57,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 19:53:57,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 19:53:57,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 19:53:57,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 19:53:57,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 19:53:57,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 19:53:57,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 19:53:57,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 19:53:57,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 19:53:57,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 19:53:57,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 19:53:57,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 19:53:57,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 19:53:57,048 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 19:53:57,067 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 19:53:57,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 19:53:57,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 19:53:57,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 19:53:57,069 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 19:53:57,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 19:53:57,070 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 19:53:57,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 19:53:57,070 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 19:53:57,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 19:53:57,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 19:53:57,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 19:53:57,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 19:53:57,072 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 19:53:57,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 19:53:57,072 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 19:53:57,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 19:53:57,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 19:53:57,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 19:53:57,073 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 19:53:57,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 19:53:57,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 19:53:57,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 19:53:57,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 19:53:57,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 19:53:57,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 19:53:57,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 19:53:57,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 19:53:57,074 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 19:53:57,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 19:53:57,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 19:53:57,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 19:53:57,400 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 19:53:57,401 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 19:53:57,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr5.c
[2019-10-13 19:53:57,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d548eca77/ab2a232750ab4ee0ae65bc3b0dbb8067/FLAG1697c62ab
[2019-10-13 19:53:57,924 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 19:53:57,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr5.c
[2019-10-13 19:53:57,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d548eca77/ab2a232750ab4ee0ae65bc3b0dbb8067/FLAG1697c62ab
[2019-10-13 19:53:58,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d548eca77/ab2a232750ab4ee0ae65bc3b0dbb8067
[2019-10-13 19:53:58,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 19:53:58,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 19:53:58,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 19:53:58,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 19:53:58,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 19:53:58,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a8eca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58, skipping insertion in model container
[2019-10-13 19:53:58,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,383 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 19:53:58,401 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 19:53:58,602 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 19:53:58,609 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 19:53:58,717 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 19:53:58,736 INFO L192 MainTranslator]: Completed translation
[2019-10-13 19:53:58,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58 WrapperNode
[2019-10-13 19:53:58,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 19:53:58,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 19:53:58,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 19:53:58,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 19:53:58,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (1/1) ...
[2019-10-13 19:53:58,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 19:53:58,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 19:53:58,787 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 19:53:58,787 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 19:53:58,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (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 19:53:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 19:53:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 19:53:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2019-10-13 19:53:58,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 19:53:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-10-13 19:53:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-10-13 19:53:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-10-13 19:53:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-10-13 19:53:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 19:53:58,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 19:53:59,162 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 19:53:59,163 INFO L284 CfgBuilder]: Removed 2 assume(true) statements.
[2019-10-13 19:53:59,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:53:59 BoogieIcfgContainer
[2019-10-13 19:53:59,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 19:53:59,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 19:53:59,166 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 19:53:59,168 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 19:53:59,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:53:58" (1/3) ...
[2019-10-13 19:53:59,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bc7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:53:59, skipping insertion in model container
[2019-10-13 19:53:59,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:53:58" (2/3) ...
[2019-10-13 19:53:59,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bc7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:53:59, skipping insertion in model container
[2019-10-13 19:53:59,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:53:59" (3/3) ...
[2019-10-13 19:53:59,172 INFO L109 eAbstractionObserver]: Analyzing ICFG pr5.c
[2019-10-13 19:53:59,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 19:53:59,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 19:53:59,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 19:53:59,221 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 19:53:59,222 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 19:53:59,222 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 19:53:59,222 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 19:53:59,222 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 19:53:59,222 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 19:53:59,222 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 19:53:59,222 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 19:53:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states.
[2019-10-13 19:53:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 19:53:59,244 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 19:53:59,245 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 19:53:59,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 19:53:59,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 19:53:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 65656709, now seen corresponding path program 1 times
[2019-10-13 19:53:59,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 19:53:59,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419346384]
[2019-10-13 19:53:59,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 19:53:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 19:53:59,463 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 19:53:59,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419346384]
[2019-10-13 19:53:59,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 19:53:59,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 19:53:59,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874832655]
[2019-10-13 19:53:59,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 19:53:59,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 19:53:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 19:53:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-10-13 19:53:59,492 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states.
[2019-10-13 19:53:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 19:53:59,576 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions.
[2019-10-13 19:53:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 19:53:59,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2019-10-13 19:53:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 19:53:59,588 INFO L225 Difference]: With dead ends: 57
[2019-10-13 19:53:59,588 INFO L226 Difference]: Without dead ends: 33
[2019-10-13 19:53:59,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-10-13 19:53:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2019-10-13 19:53:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32.
[2019-10-13 19:53:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2019-10-13 19:53:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions.
[2019-10-13 19:53:59,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16
[2019-10-13 19:53:59,627 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 19:53:59,627 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions.
[2019-10-13 19:53:59,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 19:53:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions.
[2019-10-13 19:53:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 19:53:59,629 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 19:53:59,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 19:53:59,630 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 19:53:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 19:53:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 67503751, now seen corresponding path program 1 times
[2019-10-13 19:53:59,631 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 19:53:59,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10234515]
[2019-10-13 19:53:59,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 19:53:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 19:53:59,846 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 19:53:59,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10234515]
[2019-10-13 19:53:59,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 19:53:59,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 19:53:59,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948871485]
[2019-10-13 19:53:59,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 19:53:59,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 19:53:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 19:53:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 19:53:59,852 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states.
[2019-10-13 19:53:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 19:53:59,954 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions.
[2019-10-13 19:53:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 19:53:59,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2019-10-13 19:53:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 19:53:59,959 INFO L225 Difference]: With dead ends: 56
[2019-10-13 19:53:59,959 INFO L226 Difference]: Without dead ends: 39
[2019-10-13 19:53:59,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 19:53:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2019-10-13 19:53:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33.
[2019-10-13 19:53:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-10-13 19:53:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions.
[2019-10-13 19:53:59,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16
[2019-10-13 19:53:59,969 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 19:53:59,969 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions.
[2019-10-13 19:53:59,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 19:53:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions.
[2019-10-13 19:53:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 19:53:59,970 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 19:53:59,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 19:53:59,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 19:53:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 19:53:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -335534155, now seen corresponding path program 1 times
[2019-10-13 19:53:59,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 19:53:59,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290557174]
[2019-10-13 19:53:59,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 19:53:59,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 19:54:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 19:54:00,291 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 19:54:00,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290557174]
[2019-10-13 19:54:00,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392937406]
[2019-10-13 19:54:00,293 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 19:54:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 19:54:00,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core
[2019-10-13 19:54:00,355 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 19:54:00,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12
[2019-10-13 19:54:00,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2019-10-13 19:54:00,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32
[2019-10-13 19:54:00,453 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,462 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,466 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28
[2019-10-13 19:54:00,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,476 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19
[2019-10-13 19:54:00,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32
[2019-10-13 19:54:00,509 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,510 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,513 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,516 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28
[2019-10-13 19:54:00,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,525 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19
[2019-10-13 19:54:00,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32
[2019-10-13 19:54:00,569 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,571 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,573 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,577 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28
[2019-10-13 19:54:00,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,588 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19
[2019-10-13 19:54:00,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21
[2019-10-13 19:54:00,625 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,626 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,629 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,632 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 19:54:00,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20
[2019-10-13 19:54:00,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,641 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20
[2019-10-13 19:54:00,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 19:54:00,713 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 19:54:00,714 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 19:54:00,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 19:54:00,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2019-10-13 19:54:00,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2019-10-13 19:54:00,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,801 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 19:54:00,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 19:54:00,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:8
[2019-10-13 19:54:00,820 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 19:54:00,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [385924710]
[2019-10-13 19:54:00,827 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24
[2019-10-13 19:54:00,863 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 19:54:00,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 19:54:00,932 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2019-10-13 19:54:00,934 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 21 root evaluator evaluations with a maximum evaluation depth of 2. Performed 21 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 28 variables.
[2019-10-13 19:54:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 19:54:00,938 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-13 19:54:00,973 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes.
[2019-10-13 19:54:00,973 INFO L551 sIntCurrentIteration]: Unifying AI predicates
[2019-10-13 19:54:00,980 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22
[2019-10-13 19:54:00,980 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-13 19:54:00,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences.
[2019-10-13 19:54:00,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 8, 6] total 15
[2019-10-13 19:54:00,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202107575]
[2019-10-13 19:54:00,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 19:54:00,982 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN
[2019-10-13 19:54:00,982 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy
[2019-10-13 19:54:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 19:54:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 19:54:00,983 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 3 states.
[2019-10-13 19:54:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 19:54:00,986 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions.
[2019-10-13 19:54:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 19:54:00,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-10-13 19:54:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 19:54:00,987 INFO L225 Difference]: With dead ends: 33
[2019-10-13 19:54:00,987 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 19:54:00,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 19:54:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 19:54:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 19:54:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 19:54:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 19:54:00,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23
[2019-10-13 19:54:00,989 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 19:54:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 19:54:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 19:54:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 19:54:00,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 19:54:01,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 19:54:01,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 19:54:01,257 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 19:54:01,258 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2019-10-13 19:54:01,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 19:54:01,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 19:54:01,258 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648)))
[2019-10-13 19:54:01,258 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 19:54:01,258 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 34) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point L27-2(lines 26 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 79) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 77) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 11 77) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L443 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed.
[2019-10-13 19:54:01,259 INFO L439 ceAbstractionStarter]: At program point L73-3(lines 73 76) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648))))
[2019-10-13 19:54:01,260 INFO L443 ceAbstractionStarter]: For program point L73-4(lines 73 76) no Hoare annotation was computed.
[2019-10-13 19:54:01,260 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 26 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,260 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 26 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,261 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,262 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 71) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648))))
[2019-10-13 19:54:01,262 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 26 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,262 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 25 71) no Hoare annotation was computed.
[2019-10-13 19:54:01,262 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 79) no Hoare annotation was computed.
[2019-10-13 19:54:01,262 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed.
[2019-10-13 19:54:01,262 INFO L439 ceAbstractionStarter]: At program point L75-2(line 75) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648))))
[2019-10-13 19:54:01,263 INFO L443 ceAbstractionStarter]: For program point L75-3(line 75) no Hoare annotation was computed.
[2019-10-13 19:54:01,263 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 79) the Hoare annotation is: (or (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648))))
[2019-10-13 19:54:01,263 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed.
[2019-10-13 19:54:01,266 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed.
[2019-10-13 19:54:01,266 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true
[2019-10-13 19:54:01,266 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed.
[2019-10-13 19:54:01,266 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed.
[2019-10-13 19:54:01,267 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed.
[2019-10-13 19:54:01,267 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed.
[2019-10-13 19:54:01,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:54:01 BoogieIcfgContainer
[2019-10-13 19:54:01,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 19:54:01,297 INFO L168 Benchmark]: Toolchain (without parser) took 2930.69 ms. Allocated memory was 136.8 MB in the beginning and 230.2 MB in the end (delta: 93.3 MB). Free memory was 101.4 MB in the beginning and 114.1 MB in the end (delta: -12.8 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB.
[2019-10-13 19:54:01,298 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 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-10-13 19:54:01,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.50 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 177.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
[2019-10-13 19:54:01,300 INFO L168 Benchmark]: Boogie Preprocessor took 48.66 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 175.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
[2019-10-13 19:54:01,301 INFO L168 Benchmark]: RCFGBuilder took 377.70 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 157.8 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB.
[2019-10-13 19:54:01,302 INFO L168 Benchmark]: TraceAbstraction took 2128.59 ms. Allocated memory was 199.8 MB in the beginning and 230.2 MB in the end (delta: 30.4 MB). Free memory was 157.1 MB in the beginning and 115.6 MB in the end (delta: 41.6 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB.
[2019-10-13 19:54:01,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.23 ms. Allocated memory is still 136.8 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 369.50 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 177.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 48.66 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 175.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 377.70 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 157.8 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 2128.59 ms. Allocated memory was 199.8 MB in the beginning and 230.2 MB in the end (delta: 30.4 MB). Free memory was 157.1 MB in the beginning and 115.6 MB in the end (delta: 41.6 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 3]: 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: 25]: Loop Invariant
Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648)
- InvariantResult [Line: 73]: Loop Invariant
Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 65 SDtfs, 58 SDslu, 126 SDs, 0 SdLazy, 51 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, 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, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 65 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 12494 SizeOfPredicates, 21 NumberOfNonLiveVariables, 98 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 111, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9242424242424242, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9545454545454546, AVG_WEAKENED_CONJUNCTS: 0.7272727272727273, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...