/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:35:58,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:35:58,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:35:58,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:35:58,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:35:58,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:35:58,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:35:58,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:35:58,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:35:58,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:35:58,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:35:58,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:35:58,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:35:58,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:35:58,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:35:58,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:35:58,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:35:58,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:35:58,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:35:58,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:35:58,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:35:58,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:35:58,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:35:58,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:35:58,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:35:58,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:35:58,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:35:58,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:35:58,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:35:58,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:35:58,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:35:58,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:35:58,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:35:58,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:35:58,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:35:58,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:35:58,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:35:58,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:35:58,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:35:59,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:35:59,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:35:59,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:35:59,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:35:59,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:35:59,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:35:59,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:35:59,017 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:35:59,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:35:59,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:35:59,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:35:59,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:35:59,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:35:59,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:35:59,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:35:59,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:35:59,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:35:59,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:35:59,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:35:59,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:35:59,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:35:59,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:35:59,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:35:59,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:35:59,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:35:59,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:35:59,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:35:59,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:35:59,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:35:59,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:35:59,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:35:59,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:35:59,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:35:59,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:35:59,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:35:59,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:35:59,307 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:35:59,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2019-11-07 00:35:59,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169ab0db9/04ff897975524cf6be588cae008df3b4/FLAG58cb4126f [2019-11-07 00:35:59,817 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:35:59,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-11-07 00:35:59,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169ab0db9/04ff897975524cf6be588cae008df3b4/FLAG58cb4126f [2019-11-07 00:36:00,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169ab0db9/04ff897975524cf6be588cae008df3b4 [2019-11-07 00:36:00,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:36:00,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:36:00,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:00,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:36:00,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:36:00,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585b3bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00, skipping insertion in model container [2019-11-07 00:36:00,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,191 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:36:00,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:36:00,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:00,382 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:36:00,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:00,423 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:36:00,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00 WrapperNode [2019-11-07 00:36:00,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:00,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:36:00,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:36:00,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:36:00,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... [2019-11-07 00:36:00,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:36:00,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:36:00,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:36:00,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:36:00,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:36:00,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:36:00,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:36:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:36:00,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:36:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:36:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:36:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:36:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:36:00,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:36:00,744 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:36:00,744 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:36:00,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:00 BoogieIcfgContainer [2019-11-07 00:36:00,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:36:00,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:36:00,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:36:00,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:36:00,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:36:00" (1/3) ... [2019-11-07 00:36:00,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd36dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:00, skipping insertion in model container [2019-11-07 00:36:00,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:00" (2/3) ... [2019-11-07 00:36:00,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd36dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:00, skipping insertion in model container [2019-11-07 00:36:00,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:00" (3/3) ... [2019-11-07 00:36:00,754 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-11-07 00:36:00,761 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:36:00,766 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:36:00,775 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:36:00,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:36:00,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:36:00,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:36:00,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:36:00,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:36:00,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:36:00,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:36:00,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:36:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-07 00:36:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:00,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:00,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:00,824 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2019-11-07 00:36:00,840 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:00,841 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457887904] [2019-11-07 00:36:00,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:00,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457887904] [2019-11-07 00:36:00,940 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:00,941 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:36:00,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584457233] [2019-11-07 00:36:00,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:36:00,949 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:36:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:00,962 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-07 00:36:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:00,984 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-07 00:36:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:36:00,985 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-07 00:36:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:00,994 INFO L225 Difference]: With dead ends: 29 [2019-11-07 00:36:00,994 INFO L226 Difference]: Without dead ends: 12 [2019-11-07 00:36:00,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-07 00:36:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-07 00:36:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-07 00:36:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-11-07 00:36:01,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-11-07 00:36:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:01,043 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-11-07 00:36:01,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:36:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-11-07 00:36:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:01,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:01,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:01,048 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2019-11-07 00:36:01,050 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:01,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963087847] [2019-11-07 00:36:01,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:01,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963087847] [2019-11-07 00:36:01,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:01,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:36:01,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939572826] [2019-11-07 00:36:01,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:36:01,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:36:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:36:01,138 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-11-07 00:36:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:01,199 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-07 00:36:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:36:01,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-07 00:36:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:01,201 INFO L225 Difference]: With dead ends: 19 [2019-11-07 00:36:01,201 INFO L226 Difference]: Without dead ends: 14 [2019-11-07 00:36:01,202 INFO L630 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-11-07 00:36:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-07 00:36:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-07 00:36:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-07 00:36:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-07 00:36:01,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-11-07 00:36:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:01,207 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-07 00:36:01,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:36:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-07 00:36:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:36:01,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:01,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:01,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2019-11-07 00:36:01,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:01,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192492296] [2019-11-07 00:36:01,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:01,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192492296] [2019-11-07 00:36:01,312 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642447752] [2019-11-07 00:36:01,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:01,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 00:36:01,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:01,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:01,436 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1366030955] [2019-11-07 00:36:01,443 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 13 [2019-11-07 00:36:01,476 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:36:01,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:36:01,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:36:01,587 INFO L272 AbstractInterpreter]: Visited 12 different actions 30 times. Merged at 2 different actions 12 times. Widened at 1 different actions 2 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 5. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-11-07 00:36:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:01,592 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:01,593 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:36:01,593 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 00:36:01,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152511338] [2019-11-07 00:36:01,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:36:01,594 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:36:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:36:01,595 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-11-07 00:36:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:01,633 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-07 00:36:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:36:01,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-07 00:36:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:01,634 INFO L225 Difference]: With dead ends: 24 [2019-11-07 00:36:01,635 INFO L226 Difference]: Without dead ends: 19 [2019-11-07 00:36:01,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:36:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-07 00:36:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-07 00:36:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-07 00:36:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-07 00:36:01,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2019-11-07 00:36:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:01,641 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-07 00:36:01,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:36:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-07 00:36:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:36:01,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:01,642 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:01,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:01,845 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 2 times [2019-11-07 00:36:01,855 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:01,855 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695000878] [2019-11-07 00:36:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:02,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695000878] [2019-11-07 00:36:02,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657888277] [2019-11-07 00:36:02,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:02,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-07 00:36:02,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:36:02,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 00:36:02,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:02,117 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:02,229 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [268574637] [2019-11-07 00:36:02,229 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:36:02,230 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:36:02,230 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:36:02,230 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-11-07 00:36:02,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538128398] [2019-11-07 00:36:02,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:36:02,232 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:36:02,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:36:02,233 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-11-07 00:36:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:02,308 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-07 00:36:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:36:02,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-07 00:36:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:02,310 INFO L225 Difference]: With dead ends: 32 [2019-11-07 00:36:02,310 INFO L226 Difference]: Without dead ends: 27 [2019-11-07 00:36:02,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:36:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-07 00:36:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-07 00:36:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-07 00:36:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-07 00:36:02,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 18 [2019-11-07 00:36:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-07 00:36:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:36:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-07 00:36:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:36:02,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:02,325 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:02,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:02,530 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 3 times [2019-11-07 00:36:02,531 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:02,531 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498571930] [2019-11-07 00:36:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:02,810 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498571930] [2019-11-07 00:36:02,811 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682506671] [2019-11-07 00:36:02,811 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:02,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 00:36:02,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:36:02,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 00:36:02,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:02,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:02,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:03,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [39640733] [2019-11-07 00:36:03,242 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:36:03,242 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:36:03,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:36:03,242 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-11-07 00:36:03,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335855078] [2019-11-07 00:36:03,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-07 00:36:03,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-07 00:36:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-11-07 00:36:03,245 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2019-11-07 00:36:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:03,412 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-11-07 00:36:03,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:36:03,413 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-07 00:36:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:03,414 INFO L225 Difference]: With dead ends: 34 [2019-11-07 00:36:03,416 INFO L226 Difference]: Without dead ends: 29 [2019-11-07 00:36:03,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-11-07 00:36:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-07 00:36:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-07 00:36:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-07 00:36:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-11-07 00:36:03,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-11-07 00:36:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:03,431 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-11-07 00:36:03,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-07 00:36:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-11-07 00:36:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:36:03,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:03,434 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:03,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:03,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 4 times [2019-11-07 00:36:03,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:03,643 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432908017] [2019-11-07 00:36:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:03,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432908017] [2019-11-07 00:36:03,774 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:03,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 00:36:03,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221697539] [2019-11-07 00:36:03,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 00:36:03,775 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 00:36:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:36:03,776 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-11-07 00:36:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:03,829 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-11-07 00:36:03,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:36:03,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-07 00:36:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:03,831 INFO L225 Difference]: With dead ends: 29 [2019-11-07 00:36:03,831 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:36:03,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:36:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:36:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:36:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:36:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:36:03,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-11-07 00:36:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:03,834 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:36:03,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 00:36:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:36:03,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:36:03,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:36:04,091 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-11-07 00:36:04,094 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:36:04,094 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:36:04,094 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:36:04,095 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:36:04,095 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:36:04,095 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:36:04,095 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2019-11-07 00:36:04,095 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2019-11-07 00:36:04,095 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2019-11-07 00:36:04,095 INFO L443 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-11-07 00:36:04,096 INFO L439 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 7 main_~i~0) (< main_~i~0 8) (<= 12 main_~sn~0) (<= main_~sn~0 12)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 10 main_~sn~0) (< main_~i~0 7) (<= 6 main_~i~0) (<= main_~sn~0 10)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14))) [2019-11-07 00:36:04,096 INFO L439 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2019-11-07 00:36:04,096 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:36:04,096 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:36:04,097 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:36:04,097 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:36:04,097 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:36:04,097 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:36:04,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:36:04 BoogieIcfgContainer [2019-11-07 00:36:04,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:36:04,116 INFO L168 Benchmark]: Toolchain (without parser) took 3940.93 ms. Allocated memory was 109.6 MB in the beginning and 215.0 MB in the end (delta: 105.4 MB). Free memory was 72.3 MB in the beginning and 196.3 MB in the end (delta: -124.1 MB). Peak memory consumption was 58.5 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,118 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 109.6 MB. Free memory was 89.5 MB in the beginning and 89.4 MB in the end (delta: 105.1 kB). Peak memory consumption was 105.1 kB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.93 ms. Allocated memory was 109.6 MB in the beginning and 125.3 MB in the end (delta: 15.7 MB). Free memory was 71.9 MB in the beginning and 100.1 MB in the end (delta: -28.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,120 INFO L168 Benchmark]: Boogie Preprocessor took 100.04 ms. Allocated memory was 125.3 MB in the beginning and 154.1 MB in the end (delta: 28.8 MB). Free memory was 100.1 MB in the beginning and 141.1 MB in the end (delta: -41.0 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,121 INFO L168 Benchmark]: RCFGBuilder took 220.87 ms. Allocated memory is still 154.1 MB. Free memory was 140.6 MB in the beginning and 130.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,122 INFO L168 Benchmark]: TraceAbstraction took 3367.62 ms. Allocated memory was 154.1 MB in the beginning and 215.0 MB in the end (delta: 60.8 MB). Free memory was 129.9 MB in the beginning and 196.3 MB in the end (delta: -66.4 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. [2019-11-07 00:36:04,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 109.6 MB. Free memory was 89.5 MB in the beginning and 89.4 MB in the end (delta: 105.1 kB). Peak memory consumption was 105.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.93 ms. Allocated memory was 109.6 MB in the beginning and 125.3 MB in the end (delta: 15.7 MB). Free memory was 71.9 MB in the beginning and 100.1 MB in the end (delta: -28.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.04 ms. Allocated memory was 125.3 MB in the beginning and 154.1 MB in the end (delta: 28.8 MB). Free memory was 100.1 MB in the beginning and 141.1 MB in the end (delta: -41.0 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 220.87 ms. Allocated memory is still 154.1 MB. Free memory was 140.6 MB in the beginning and 130.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3367.62 ms. Allocated memory was 154.1 MB in the beginning and 215.0 MB in the end (delta: 60.8 MB). Free memory was 129.9 MB in the beginning and 196.3 MB in the end (delta: -66.4 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((1 <= i && i <= 1) && sn <= 0) && 0 <= sn) || (((7 <= i && i < 8) && 12 <= sn) && sn <= 12)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((10 <= sn && i < 7) && 6 <= i) && sn <= 10)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 9, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 70 SDtfs, 15 SDslu, 310 SDs, 0 SdLazy, 250 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 127 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 15298 SizeOfPredicates, 4 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 81/324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...