/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:28:50,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:28:50,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:28:50,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:28:50,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:28:50,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:28:50,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:28:50,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:28:50,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:28:50,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:28:50,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:28:50,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:28:50,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:28:50,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:28:50,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:28:50,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:28:50,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:28:50,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:28:50,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:28:50,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:28:50,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:28:50,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:28:50,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:28:50,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:28:50,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:28:50,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:28:50,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:28:50,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:28:50,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:28:50,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:28:50,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:28:50,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:28:50,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:28:50,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:28:50,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:28:50,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:28:50,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:28:50,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:28:50,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:28:50,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:28:50,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:28:50,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:28:50,176 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:28:50,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:28:50,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:28:50,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:28:50,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:28:50,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:28:50,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:28:50,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:28:50,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:28:50,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:28:50,180 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:28:50,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:28:50,181 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:28:50,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:28:50,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:28:50,181 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:28:50,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:28:50,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:28:50,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:50,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:28:50,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:28:50,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:28:50,183 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:28:50,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:28:50,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:28:50,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:28:50,875 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:28:50,877 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:28:50,878 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-09-04 16:28:51,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e13c773e/eba8ad1f0af94d05a7f089857652ca97/FLAG9b0b2bf06 [2020-09-04 16:28:51,832 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:28:51,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-09-04 16:28:51,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e13c773e/eba8ad1f0af94d05a7f089857652ca97/FLAG9b0b2bf06 [2020-09-04 16:28:52,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e13c773e/eba8ad1f0af94d05a7f089857652ca97 [2020-09-04 16:28:52,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:28:52,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:28:52,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:52,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:28:52,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:28:52,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362a4e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52, skipping insertion in model container [2020-09-04 16:28:52,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:28:52,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:28:52,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:52,558 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:28:52,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:52,609 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:28:52,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52 WrapperNode [2020-09-04 16:28:52,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:52,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:28:52,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:28:52,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:28:52,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... [2020-09-04 16:28:52,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:28:52,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:28:52,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:28:52,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:28:52,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 16:28:52,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:28:52,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:28:52,900 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:28:52,900 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-09-04 16:28:52,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:28:52,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:28:52,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:28:53,170 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:28:53,171 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:28:53,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:53 BoogieIcfgContainer [2020-09-04 16:28:53,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:28:53,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:28:53,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:28:53,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:28:53,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:28:52" (1/3) ... [2020-09-04 16:28:53,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ff587b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:53, skipping insertion in model container [2020-09-04 16:28:53,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:52" (2/3) ... [2020-09-04 16:28:53,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ff587b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:53, skipping insertion in model container [2020-09-04 16:28:53,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:53" (3/3) ... [2020-09-04 16:28:53,192 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-09-04 16:28:53,210 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:28:53,224 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:28:53,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:28:53,331 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:28:53,332 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:28:53,332 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:28:53,332 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:28:53,333 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:28:53,333 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:28:53,333 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:28:53,333 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:28:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-09-04 16:28:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:28:53,382 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:53,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:53,385 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-09-04 16:28:53,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:53,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492896306] [2020-09-04 16:28:53,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:53,511 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:53,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492896306] [2020-09-04 16:28:53,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:53,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:53,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126965368] [2020-09-04 16:28:53,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:53,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:53,771 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-09-04 16:28:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:53,930 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-09-04 16:28:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:28:53,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:28:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:53,950 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:28:53,951 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 16:28:53,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 16:28:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-09-04 16:28:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 16:28:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-09-04 16:28:54,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-09-04 16:28:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:54,036 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-09-04 16:28:54,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-09-04 16:28:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:28:54,040 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:54,041 INFO L422 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] [2020-09-04 16:28:54,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:28:54,042 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-09-04 16:28:54,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:54,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030569904] [2020-09-04 16:28:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:54,047 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:54,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030569904] [2020-09-04 16:28:54,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:54,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:28:54,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594773488] [2020-09-04 16:28:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:28:54,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:28:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:28:54,234 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-09-04 16:28:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:54,365 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-09-04 16:28:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:28:54,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-04 16:28:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:54,368 INFO L225 Difference]: With dead ends: 45 [2020-09-04 16:28:54,369 INFO L226 Difference]: Without dead ends: 39 [2020-09-04 16:28:54,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:28:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-04 16:28:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-09-04 16:28:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 16:28:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-09-04 16:28:54,388 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-09-04 16:28:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:54,388 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-09-04 16:28:54,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:28:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-09-04 16:28:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:28:54,391 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:54,391 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2020-09-04 16:28:54,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:28:54,392 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-09-04 16:28:54,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:54,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136412439] [2020-09-04 16:28:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:54,422 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:28:54,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136412439] [2020-09-04 16:28:54,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:54,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:28:54,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80715954] [2020-09-04 16:28:54,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:28:54,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:54,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:28:54,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:54,693 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-09-04 16:28:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:54,837 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-09-04 16:28:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:28:54,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-09-04 16:28:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:54,840 INFO L225 Difference]: With dead ends: 55 [2020-09-04 16:28:54,841 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 16:28:54,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 16:28:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-09-04 16:28:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:28:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-09-04 16:28:54,859 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-09-04 16:28:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:54,860 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-09-04 16:28:54,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:28:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-09-04 16:28:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:28:54,862 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:54,863 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:54,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:28:54,863 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-09-04 16:28:54,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:54,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386479009] [2020-09-04 16:28:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:54,872 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:55,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386479009] [2020-09-04 16:28:55,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:55,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:28:55,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037944725] [2020-09-04 16:28:55,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:28:55,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:28:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:28:55,081 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-09-04 16:28:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:55,194 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-09-04 16:28:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:28:55,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-09-04 16:28:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:55,197 INFO L225 Difference]: With dead ends: 65 [2020-09-04 16:28:55,197 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 16:28:55,198 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:28:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 16:28:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-09-04 16:28:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:28:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-09-04 16:28:55,214 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-09-04 16:28:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:55,214 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-09-04 16:28:55,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:28:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-09-04 16:28:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:28:55,216 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:55,216 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:55,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:28:55,217 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-09-04 16:28:55,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:55,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913233735] [2020-09-04 16:28:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:55,224 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:28:55,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913233735] [2020-09-04 16:28:55,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:55,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:28:55,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293955541] [2020-09-04 16:28:55,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:28:55,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:28:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:28:55,545 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-09-04 16:28:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:55,678 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-09-04 16:28:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:28:55,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-09-04 16:28:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:55,681 INFO L225 Difference]: With dead ends: 75 [2020-09-04 16:28:55,681 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 16:28:55,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:28:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 16:28:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-09-04 16:28:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 16:28:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-09-04 16:28:55,701 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-09-04 16:28:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:55,702 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-09-04 16:28:55,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:28:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-09-04 16:28:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:28:55,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:55,704 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:55,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:28:55,705 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-09-04 16:28:55,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:55,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882481738] [2020-09-04 16:28:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:55,711 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:28:56,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882481738] [2020-09-04 16:28:56,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:56,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:28:56,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280027569] [2020-09-04 16:28:56,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:28:56,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:28:56,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:28:56,128 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 15 states. [2020-09-04 16:28:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:56,453 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-09-04 16:28:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:28:56,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-09-04 16:28:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:56,456 INFO L225 Difference]: With dead ends: 85 [2020-09-04 16:28:56,456 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 16:28:56,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 16:28:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2020-09-04 16:28:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 16:28:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-09-04 16:28:56,473 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 56 [2020-09-04 16:28:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:56,473 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-09-04 16:28:56,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:28:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-09-04 16:28:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:28:56,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:56,476 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:56,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:28:56,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash -996081148, now seen corresponding path program 3 times [2020-09-04 16:28:56,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:56,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734836091] [2020-09-04 16:28:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:56,484 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 16:28:56,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734836091] [2020-09-04 16:28:56,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:56,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:28:56,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198071668] [2020-09-04 16:28:56,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:28:56,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:28:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:28:56,787 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 12 states. [2020-09-04 16:28:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:57,198 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2020-09-04 16:28:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:28:57,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-09-04 16:28:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:57,201 INFO L225 Difference]: With dead ends: 156 [2020-09-04 16:28:57,201 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 16:28:57,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:28:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 16:28:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2020-09-04 16:28:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:28:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:28:57,227 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 64 [2020-09-04 16:28:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:57,228 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:28:57,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:28:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:28:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:28:57,230 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:57,230 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:57,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:28:57,255 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1686185158, now seen corresponding path program 3 times [2020-09-04 16:28:57,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:57,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543159081] [2020-09-04 16:28:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:57,263 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:57,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543159081] [2020-09-04 16:28:57,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:57,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:28:57,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110989651] [2020-09-04 16:28:57,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:28:57,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:28:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:28:57,626 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 13 states. [2020-09-04 16:28:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:57,942 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-09-04 16:28:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:28:57,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-09-04 16:28:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:57,944 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:28:57,944 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:28:57,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:28:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:28:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:28:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:28:57,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2020-09-04 16:28:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:57,948 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:28:57,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:28:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:28:57,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:28:57,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:28:57,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:28:59,707 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-09-04 16:29:00,067 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2020-09-04 16:29:00,440 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2020-09-04 16:29:00,682 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2020-09-04 16:29:00,857 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-09-04 16:29:01,164 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2020-09-04 16:29:01,557 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2020-09-04 16:29:01,705 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-09-04 16:29:01,925 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-09-04 16:29:02,200 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-09-04 16:29:02,209 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,210 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,210 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-09-04 16:29:02,210 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-09-04 16:29:02,211 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (= id2_~x |id2_#in~x|))) (let ((.cse2 (<= 4 |id2_#in~x|)) (.cse1 (and (or (<= |id2_#in~x| 3) (and (<= 3 |id2_#t~ret1|) (<= |id2_#t~ret1| 3))) (<= 3 |id2_#in~x|) .cse0))) (and (or (and (<= 5 |id2_#in~x|) .cse0) .cse1 (not .cse2)) (or (and (or (<= |id2_#in~x| 1) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|))) (<= 1 |id2_#in~x|) .cse0) .cse2 .cse1)))) [2020-09-04 16:29:02,211 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (= |id2_#in~x| 0) (= id2_~x |id2_#in~x|)) [2020-09-04 16:29:02,211 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (= id2_~x |id2_#in~x|))) (let ((.cse2 (<= 4 |id2_#in~x|)) (.cse1 (and (or (<= |id2_#in~x| 3) (and (<= 3 |id2_#t~ret1|) (<= |id2_#t~ret1| 3))) (<= 3 |id2_#in~x|) .cse0))) (and (or (and (<= 5 |id2_#in~x|) .cse0) .cse1 (not .cse2)) (or (and (or (<= |id2_#in~x| 1) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|))) (<= 1 |id2_#in~x|) .cse0) .cse2 .cse1)))) [2020-09-04 16:29:02,211 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse1 (= id2_~x |id2_#in~x|))) (let ((.cse2 (<= 4 |id2_#in~x|)) (.cse0 (and (<= 3 |id2_#in~x|) (or (<= |id2_#in~x| 3) (and (<= 3 |id2_#t~ret1|) (<= |id2_#res| 4) (<= |id2_#t~ret1| 3) (<= 4 |id2_#res|))) .cse1))) (and (or .cse0 (and (<= 5 |id2_#in~x|) .cse1) (not .cse2)) (or (and (or (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|) (<= 2 |id2_#res|) (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse1) .cse2 .cse0)))) [2020-09-04 16:29:02,212 INFO L264 CegarLoopResult]: At program point id2EXIT(lines 12 15) the Hoare annotation is: (let ((.cse5 (<= |id2_#in~x| 3)) (.cse1 (= id2_~x |id2_#in~x|))) (let ((.cse4 (<= 4 |id2_#in~x|)) (.cse2 (and (or (and (<= 2 |id2_#res|) .cse5 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse1)) (.cse3 (and (or (and (<= |id2_#res| 4) (<= 4 |id2_#res|)) .cse5) (<= 3 |id2_#in~x|) .cse1)) (.cse0 (<= 2 |id2_#in~x|))) (and (or .cse0 (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse1) .cse2) (or (and (<= 5 |id2_#in~x|) .cse1) .cse3 (not .cse4)) (or .cse4 .cse2 .cse3 (not .cse0))))) [2020-09-04 16:29:02,212 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-09-04 16:29:02,212 INFO L264 CegarLoopResult]: At program point id2FINAL(lines 12 15) the Hoare annotation is: (let ((.cse5 (<= |id2_#in~x| 3)) (.cse1 (= id2_~x |id2_#in~x|))) (let ((.cse4 (<= 4 |id2_#in~x|)) (.cse2 (and (or (and (<= 2 |id2_#res|) .cse5 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse1)) (.cse3 (and (or (and (<= |id2_#res| 4) (<= 4 |id2_#res|)) .cse5) (<= 3 |id2_#in~x|) .cse1)) (.cse0 (<= 2 |id2_#in~x|))) (and (or .cse0 (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse1) .cse2) (or (and (<= 5 |id2_#in~x|) .cse1) .cse3 (not .cse4)) (or .cse4 .cse2 .cse3 (not .cse0))))) [2020-09-04 16:29:02,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,212 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:02,213 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: false [2020-09-04 16:29:02,213 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 17 23) the Hoare annotation is: true [2020-09-04 16:29:02,213 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-09-04 16:29:02,213 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: false [2020-09-04 16:29:02,213 INFO L264 CegarLoopResult]: At program point L20(lines 20 22) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:29:02,214 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-09-04 16:29:02,214 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0)) [2020-09-04 16:29:02,214 INFO L264 CegarLoopResult]: At program point L20-2(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-09-04 16:29:02,214 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0)) [2020-09-04 16:29:02,214 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:29:02,215 INFO L264 CegarLoopResult]: At program point idFINAL(lines 7 10) the Hoare annotation is: (and (or (<= 6 |id_#in~x|) (<= |id_#in~x| 4) (and (<= 5 |id_#res|) (<= |id_#res| 5))) (let ((.cse1 (<= |id_#in~x| 2)) (.cse0 (= |id_#in~x| id_~x)) (.cse3 (= |id_#in~x| 0))) (let ((.cse2 (or (and .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse0 .cse3)))) (or (and .cse0 (or (and .cse0 .cse1) (and (<= |id_#res| 3) (<= 3 |id_#res|))) (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2) (and .cse0 (<= 4 |id_#in~x|)) (and .cse2 .cse3))))) [2020-09-04 16:29:02,215 INFO L264 CegarLoopResult]: At program point idEXIT(lines 7 10) the Hoare annotation is: (and (or (<= 6 |id_#in~x|) (<= |id_#in~x| 4) (and (<= 5 |id_#res|) (<= |id_#res| 5))) (let ((.cse1 (<= |id_#in~x| 2)) (.cse0 (= |id_#in~x| id_~x)) (.cse3 (= |id_#in~x| 0))) (let ((.cse2 (or (and .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse0 .cse3)))) (or (and .cse0 (or (and .cse0 .cse1) (and (<= |id_#res| 3) (<= 3 |id_#res|))) (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2) (and .cse0 (<= 4 |id_#in~x|)) (and .cse2 .cse3))))) [2020-09-04 16:29:02,215 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:02,215 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:02,216 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 4)) (.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and (<= |id_#t~ret0| 2) .cse0 .cse1 (<= 2 |id_#t~ret0|))) (<= 2 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= 4 |id_#in~x|) (or (and .cse0 .cse1) (and .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)))))) [2020-09-04 16:29:02,216 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-09-04 16:29:02,216 INFO L264 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-09-04 16:29:02,216 INFO L264 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 4)) (.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and (<= |id_#t~ret0| 2) .cse0 .cse1 (<= 2 |id_#t~ret0|))) (<= 2 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= 4 |id_#in~x|) (or (and .cse0 .cse1) (and .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)))))) [2020-09-04 16:29:02,217 INFO L264 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse1 (<= |id_#in~x| 4))) (or (and (<= 4 |id_#in~x|) (or (and (<= 5 |id_#res|) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and .cse0 .cse1))) (and .cse0 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= |id_#t~ret0| 2) .cse0 .cse1 (<= 3 |id_#res|) (<= 2 |id_#t~ret0|))) (<= 2 |id_#in~x|)))) [2020-09-04 16:29:02,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:29:02 BoogieIcfgContainer [2020-09-04 16:29:02,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:29:02,264 INFO L168 Benchmark]: Toolchain (without parser) took 10076.48 ms. Allocated memory was 143.7 MB in the beginning and 330.8 MB in the end (delta: 187.2 MB). Free memory was 101.5 MB in the beginning and 258.5 MB in the end (delta: -157.1 MB). Peak memory consumption was 173.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,265 INFO L168 Benchmark]: CDTParser took 1.77 ms. Allocated memory is still 143.7 MB. Free memory was 119.4 MB in the beginning and 118.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.67 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,268 INFO L168 Benchmark]: Boogie Preprocessor took 173.19 ms. Allocated memory was 143.7 MB in the beginning and 197.7 MB in the end (delta: 54.0 MB). Free memory was 91.8 MB in the beginning and 176.3 MB in the end (delta: -84.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,268 INFO L168 Benchmark]: RCFGBuilder took 392.81 ms. Allocated memory is still 197.7 MB. Free memory was 176.3 MB in the beginning and 163.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,269 INFO L168 Benchmark]: TraceAbstraction took 9077.87 ms. Allocated memory was 197.7 MB in the beginning and 330.8 MB in the end (delta: 133.2 MB). Free memory was 163.2 MB in the beginning and 258.5 MB in the end (delta: -95.3 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:02,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.77 ms. Allocated memory is still 143.7 MB. Free memory was 119.4 MB in the beginning and 118.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 419.67 ms. Allocated memory is still 143.7 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.19 ms. Allocated memory was 143.7 MB in the beginning and 197.7 MB in the end (delta: 54.0 MB). Free memory was 91.8 MB in the beginning and 176.3 MB in the end (delta: -84.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.81 ms. Allocated memory is still 197.7 MB. Free memory was 176.3 MB in the beginning and 163.2 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9077.87 ms. Allocated memory was 197.7 MB in the beginning and 330.8 MB in the end (delta: 133.2 MB). Free memory was 163.2 MB in the beginning and 258.5 MB in the end (delta: -95.3 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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 - ProcedureContractResult [Line: 12]: Procedure Contract for id2 Derived contract for procedure id2: (((2 <= \old(x) || ((\old(x) == 0 && \result == 0) && x == \old(x))) || (((((2 <= \result && \old(x) <= 3) && \result <= 2) || \old(x) <= 1) && 1 <= \old(x)) && x == \old(x))) && (((5 <= \old(x) && x == \old(x)) || ((((\result <= 4 && 4 <= \result) || \old(x) <= 3) && 3 <= \old(x)) && x == \old(x))) || !(4 <= \old(x)))) && (((4 <= \old(x) || (((((2 <= \result && \old(x) <= 3) && \result <= 2) || \old(x) <= 1) && 1 <= \old(x)) && x == \old(x))) || ((((\result <= 4 && 4 <= \result) || \old(x) <= 3) && 3 <= \old(x)) && x == \old(x))) || !(2 <= \old(x))) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 7]: Procedure Contract for id Derived contract for procedure id: ((6 <= \old(x) || \old(x) <= 4) || (5 <= \result && \result <= 5)) && (((((\old(x) == x && ((\old(x) == x && \old(x) <= 2) || (\result <= 3 && 3 <= \result))) && 2 <= \old(x)) || (1 <= \old(x) && ((((\old(x) == x && \result <= 1) && 1 <= \result) && \old(x) <= 2) || (\old(x) == x && \old(x) == 0)))) || (\old(x) == x && 4 <= \old(x))) || (((((\old(x) == x && \result <= 1) && 1 <= \result) && \old(x) <= 2) || (\old(x) == x && \old(x) == 0)) && \old(x) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 194 SDslu, 1616 SDs, 0 SdLazy, 823 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 90 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 88 PreInvPairs, 383 NumberOfFragments, 965 HoareAnnotationTreeSize, 88 FomulaSimplifications, 22263 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 34 FomulaSimplificationsInter, 3069 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...