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-crafted/zero_sum_const5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:51:50,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:51:50,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:51:50,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:51:50,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:51:50,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:51:50,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:51:50,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:51:50,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:51:50,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:51:50,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:51:50,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:51:50,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:51:50,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:51:50,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:51:50,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:51:50,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:51:50,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:51:50,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:51:50,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:51:50,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:51:50,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:51:50,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:51:50,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:51:50,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:51:50,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:51:50,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:51:50,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:51:50,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:51:50,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:51:50,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:51:50,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:51:50,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:51:50,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:51:50,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:51:50,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:51:50,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:51:50,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:51:50,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:51:50,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:51:50,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:51:50,303 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-14 23:51:50,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:51:50,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:51:50,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:51:50,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:51:50,320 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:51:50,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:51:50,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:51:50,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:51:50,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:51:50,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:51:50,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:51:50,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:51:50,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:51:50,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:51:50,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:51:50,323 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:51:50,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:51:50,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:51:50,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:51:50,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:51:50,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:51:50,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:50,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:51:50,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:51:50,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:51:50,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:51:50,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:51:50,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:51:50,329 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-14 23:51:50,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:51:50,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:51:50,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:51:50,655 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:51:50,656 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:51:50,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const5.c [2019-10-14 23:51:50,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00ef4c3c/6d51c4f12eb94c89ae31f16fa8a670c4/FLAGdc5969bce [2019-10-14 23:51:51,189 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:51:51,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const5.c [2019-10-14 23:51:51,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00ef4c3c/6d51c4f12eb94c89ae31f16fa8a670c4/FLAGdc5969bce [2019-10-14 23:51:51,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00ef4c3c/6d51c4f12eb94c89ae31f16fa8a670c4 [2019-10-14 23:51:51,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:51:51,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:51:51,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:51:51,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:51:51,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d874e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51, skipping insertion in model container [2019-10-14 23:51:51,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:51:51,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:51:51,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,840 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:51:51,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,876 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:51:51,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51 WrapperNode [2019-10-14 23:51:51,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:51:51,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:51:51,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:51:51,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:52,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:52,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:52,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:52,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:51:52,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:51:52,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:51:52,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:51:52,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (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-14 23:51:52,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:51:52,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:51:52,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:51:52,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:51:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:51:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:51:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:51:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:51:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:51:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:51:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:51:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:51:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:51:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:51:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:51:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:51:52,462 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:51:52,462 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-14 23:51:52,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52 BoogieIcfgContainer [2019-10-14 23:51:52,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:51:52,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:51:52,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:51:52,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:51:52,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:51:51" (1/3) ... [2019-10-14 23:51:52,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1945893a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51" (2/3) ... [2019-10-14 23:51:52,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1945893a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52" (3/3) ... [2019-10-14 23:51:52,471 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const5.c [2019-10-14 23:51:52,479 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:51:52,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:51:52,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:51:52,525 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:51:52,525 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:51:52,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:51:52,526 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:51:52,526 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:51:52,526 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:51:52,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:51:52,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:51:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-10-14 23:51:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:51:52,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1272746570, now seen corresponding path program 1 times [2019-10-14 23:51:52,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791624626] [2019-10-14 23:51:52,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,733 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-14 23:51:52,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791624626] [2019-10-14 23:51:52,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:51:52,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644412208] [2019-10-14 23:51:52,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:51:52,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:51:52,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:51:52,766 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-10-14 23:51:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,814 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-10-14 23:51:52,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:51:52,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-14 23:51:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,829 INFO L225 Difference]: With dead ends: 93 [2019-10-14 23:51:52,829 INFO L226 Difference]: Without dead ends: 44 [2019-10-14 23:51:52,835 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-14 23:51:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-14 23:51:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-14 23:51:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 23:51:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-14 23:51:52,900 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2019-10-14 23:51:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,900 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-14 23:51:52,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:51:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-14 23:51:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:51:52,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1923539238, now seen corresponding path program 1 times [2019-10-14 23:51:52,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407122510] [2019-10-14 23:51:52,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,055 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-14 23:51:53,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407122510] [2019-10-14 23:51:53,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:51:53,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32596539] [2019-10-14 23:51:53,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:51:53,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:51:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:51:53,060 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2019-10-14 23:51:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,183 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-10-14 23:51:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:51:53,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-14 23:51:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,186 INFO L225 Difference]: With dead ends: 68 [2019-10-14 23:51:53,186 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:51:53,188 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-14 23:51:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:51:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-14 23:51:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:51:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2019-10-14 23:51:53,219 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 32 [2019-10-14 23:51:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,220 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2019-10-14 23:51:53,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:51:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2019-10-14 23:51:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:51:53,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -772301532, now seen corresponding path program 1 times [2019-10-14 23:51:53,226 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609713983] [2019-10-14 23:51:53,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:51:53,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609713983] [2019-10-14 23:51:53,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:51:53,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998701760] [2019-10-14 23:51:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:51:53,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:51:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:51:53,313 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 3 states. [2019-10-14 23:51:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,457 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2019-10-14 23:51:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:53,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:51:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,461 INFO L225 Difference]: With dead ends: 119 [2019-10-14 23:51:53,463 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 23:51:53,464 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-14 23:51:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 23:51:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-14 23:51:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:51:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-10-14 23:51:53,478 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 34 [2019-10-14 23:51:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,478 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-10-14 23:51:53,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:51:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-10-14 23:51:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:51:53,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,480 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -213249118, now seen corresponding path program 1 times [2019-10-14 23:51:53,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655553314] [2019-10-14 23:51:53,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:53,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655553314] [2019-10-14 23:51:53,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:51:53,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631421668] [2019-10-14 23:51:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:53,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,570 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 4 states. [2019-10-14 23:51:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,760 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-10-14 23:51:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:51:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-14 23:51:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,762 INFO L225 Difference]: With dead ends: 115 [2019-10-14 23:51:53,762 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:51:53,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:51:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2019-10-14 23:51:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 23:51:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-10-14 23:51:53,771 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 36 [2019-10-14 23:51:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,771 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-10-14 23:51:53,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-10-14 23:51:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 23:51:53,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:51:53,774 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 25817296, now seen corresponding path program 1 times [2019-10-14 23:51:53,777 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243393065] [2019-10-14 23:51:53,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:51:53,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243393065] [2019-10-14 23:51:53,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301011800] [2019-10-14 23:51:53,924 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-14 23:51:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:54,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:51:54,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:51:54,086 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:51:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:51:54,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1605459013] [2019-10-14 23:51:54,127 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 55 [2019-10-14 23:51:54,175 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:51:54,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:51:54,291 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:51:54,293 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 44 variables. [2019-10-14 23:51:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:54,297 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:51:54,375 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:51:54,375 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:51:54,389 INFO L553 sIntCurrentIteration]: We unified 53 AI predicates to 53 [2019-10-14 23:51:54,389 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:51:54,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:51:54,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2019-10-14 23:51:54,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325720667] [2019-10-14 23:51:54,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:54,393 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:54,393 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:51:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:54,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:54,394 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 4 states. [2019-10-14 23:51:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:54,402 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-10-14 23:51:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:54,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-10-14 23:51:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:54,402 INFO L225 Difference]: With dead ends: 55 [2019-10-14 23:51:54,402 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:51:54,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:51:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:51:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:51:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:51:54,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-10-14 23:51:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:54,406 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:51:54,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:51:54,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:51:54,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:54,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:51:54,757 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,758 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,758 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,758 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,758 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:51:54,758 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,759 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,759 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,759 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 38) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,759 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,759 INFO L443 ceAbstractionStarter]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2019-10-14 23:51:54,760 INFO L439 ceAbstractionStarter]: At program point L60-3(lines 60 63) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,760 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 77) no Hoare annotation was computed. [2019-10-14 23:51:54,760 INFO L443 ceAbstractionStarter]: For program point L60-4(lines 60 63) no Hoare annotation was computed. [2019-10-14 23:51:54,760 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,760 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,760 INFO L443 ceAbstractionStarter]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,760 INFO L443 ceAbstractionStarter]: For program point L45-2(lines 45 48) no Hoare annotation was computed. [2019-10-14 23:51:54,761 INFO L439 ceAbstractionStarter]: At program point L45-3(lines 45 48) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,761 INFO L443 ceAbstractionStarter]: For program point L45-4(lines 45 48) no Hoare annotation was computed. [2019-10-14 23:51:54,761 INFO L443 ceAbstractionStarter]: For program point L70-2(lines 70 73) no Hoare annotation was computed. [2019-10-14 23:51:54,761 INFO L439 ceAbstractionStarter]: At program point L70-3(lines 70 73) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,761 INFO L439 ceAbstractionStarter]: At program point L70-4(lines 70 73) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (= main_~sum~0 0) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,762 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 77) no Hoare annotation was computed. [2019-10-14 23:51:54,762 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 77) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:51:54,762 INFO L443 ceAbstractionStarter]: For program point L30-2(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,762 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,762 INFO L443 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,762 INFO L443 ceAbstractionStarter]: For program point L55-2(lines 55 58) no Hoare annotation was computed. [2019-10-14 23:51:54,763 INFO L439 ceAbstractionStarter]: At program point L55-3(lines 55 58) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,763 INFO L443 ceAbstractionStarter]: For program point L55-4(lines 55 58) no Hoare annotation was computed. [2019-10-14 23:51:54,763 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 75) no Hoare annotation was computed. [2019-10-14 23:51:54,763 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 75) no Hoare annotation was computed. [2019-10-14 23:51:54,763 INFO L443 ceAbstractionStarter]: For program point L40-2(lines 40 43) no Hoare annotation was computed. [2019-10-14 23:51:54,763 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 43) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,764 INFO L443 ceAbstractionStarter]: For program point L40-4(lines 40 43) no Hoare annotation was computed. [2019-10-14 23:51:54,764 INFO L443 ceAbstractionStarter]: For program point L65-2(lines 65 68) no Hoare annotation was computed. [2019-10-14 23:51:54,764 INFO L439 ceAbstractionStarter]: At program point L65-3(lines 65 68) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,764 INFO L443 ceAbstractionStarter]: For program point L65-4(lines 65 68) no Hoare annotation was computed. [2019-10-14 23:51:54,764 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,764 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 28) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,765 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,765 INFO L443 ceAbstractionStarter]: For program point L50-2(lines 50 53) no Hoare annotation was computed. [2019-10-14 23:51:54,765 INFO L439 ceAbstractionStarter]: At program point L50-3(lines 50 53) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,765 INFO L443 ceAbstractionStarter]: For program point L50-4(lines 50 53) no Hoare annotation was computed. [2019-10-14 23:51:54,765 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,765 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:51:54,765 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,766 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,766 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,766 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:51:54 BoogieIcfgContainer [2019-10-14 23:51:54,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:51:54,803 INFO L168 Benchmark]: Toolchain (without parser) took 3209.61 ms. Allocated memory was 138.4 MB in the beginning and 234.9 MB in the end (delta: 96.5 MB). Free memory was 103.0 MB in the beginning and 123.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,807 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:51:54,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.71 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 181.8 MB in the end (delta: -79.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,809 INFO L168 Benchmark]: Boogie Preprocessor took 62.74 ms. Allocated memory is still 201.9 MB. Free memory was 181.8 MB in the beginning and 178.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,810 INFO L168 Benchmark]: RCFGBuilder took 443.81 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 157.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,812 INFO L168 Benchmark]: TraceAbstraction took 2334.31 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 156.2 MB in the beginning and 123.2 MB in the end (delta: 33.0 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,816 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 362.71 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.5 MB in the beginning and 181.8 MB in the end (delta: -79.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.74 ms. Allocated memory is still 201.9 MB. Free memory was 181.8 MB in the beginning and 178.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 443.81 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 157.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2334.31 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 156.2 MB in the beginning and 123.2 MB in the end (delta: 33.0 MB). Peak memory consumption was 66.1 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: 30]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. Result: SAFE, OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 184 SDtfs, 73 SDslu, 138 SDs, 0 SdLazy, 162 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 21 PreInvPairs, 22 NumberOfFragments, 222 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 17339 SizeOfPredicates, 3 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 33/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 170, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9834905660377359, AVG_VARS_REMOVED_DURING_WEAKENING: 0.8301886792452831, AVG_WEAKENED_CONJUNCTS: 0.41509433962264153, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...