/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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-72570d3 [2020-08-22 22:10:01,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:10:01,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:10:02,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:10:02,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:10:02,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:10:02,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:10:02,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:10:02,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:10:02,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:10:02,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:10:02,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:10:02,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:10:02,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:10:02,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:10:02,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:10:02,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:10:02,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:10:02,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:10:02,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:10:02,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:10:02,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:10:02,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:10:02,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:10:02,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:10:02,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:10:02,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:10:02,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:10:02,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:10:02,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:10:02,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:10:02,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:10:02,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:10:02,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:10:02,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:10:02,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:10:02,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:10:02,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:10:02,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:10:02,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:10:02,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:10:02,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:10:02,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:10:02,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:10:02,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:10:02,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:10:02,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:10:02,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:10:02,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:10:02,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:10:02,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:10:02,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:10:02,111 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:10:02,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:10:02,111 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:10:02,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:10:02,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:10:02,112 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:10:02,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:10:02,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:10:02,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:10:02,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:10:02,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:10:02,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:10:02,113 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 22:10:02,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:10:02,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:10:02,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:10:02,416 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:10:02,416 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:10:02,417 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-08-22 22:10:02,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3202881/c425516dc48e4db1aa35f1e6c5848b71/FLAG215f2b19c [2020-08-22 22:10:02,940 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:10:02,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-08-22 22:10:02,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3202881/c425516dc48e4db1aa35f1e6c5848b71/FLAG215f2b19c [2020-08-22 22:10:03,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3202881/c425516dc48e4db1aa35f1e6c5848b71 [2020-08-22 22:10:03,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:10:03,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:10:03,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:10:03,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:10:03,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:10:03,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee223a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03, skipping insertion in model container [2020-08-22 22:10:03,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:10:03,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:10:03,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:10:03,513 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:10:03,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:10:03,544 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:10:03,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03 WrapperNode [2020-08-22 22:10:03,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:10:03,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:10:03,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:10:03,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:10:03,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (1/1) ... [2020-08-22 22:10:03,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:10:03,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:10:03,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:10:03,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:10:03,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (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 [2020-08-22 22:10:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:10:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:10:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-22 22:10:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-08-22 22:10:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:10:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:10:03,912 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:10:03,913 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:10:03,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:10:03 BoogieIcfgContainer [2020-08-22 22:10:03,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:10:03,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:10:03,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:10:03,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:10:03,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:10:03" (1/3) ... [2020-08-22 22:10:03,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449579e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:10:03, skipping insertion in model container [2020-08-22 22:10:03,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:10:03" (2/3) ... [2020-08-22 22:10:03,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449579e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:10:03, skipping insertion in model container [2020-08-22 22:10:03,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:10:03" (3/3) ... [2020-08-22 22:10:03,926 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-08-22 22:10:03,938 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:10:03,945 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:10:03,960 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:10:04,019 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:10:04,019 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:10:04,019 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:10:04,020 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:10:04,020 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:10:04,020 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:10:04,020 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:10:04,021 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:10:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-08-22 22:10:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-08-22 22:10:04,063 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:04,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:10:04,064 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:04,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash -588914908, now seen corresponding path program 1 times [2020-08-22 22:10:04,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:04,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1479619954] [2020-08-22 22:10:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:10:04,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1479619954] [2020-08-22 22:10:04,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:10:04,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 22:10:04,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285935371] [2020-08-22 22:10:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 22:10:04,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 22:10:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 22:10:04,309 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-08-22 22:10:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:04,391 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-08-22 22:10:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 22:10:04,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-08-22 22:10:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:04,404 INFO L225 Difference]: With dead ends: 46 [2020-08-22 22:10:04,405 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 22:10:04,409 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-08-22 22:10:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 22:10:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-08-22 22:10:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-22 22:10:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-08-22 22:10:04,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 16 [2020-08-22 22:10:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:04,459 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-08-22 22:10:04,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 22:10:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-08-22 22:10:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-22 22:10:04,461 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:04,462 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-08-22 22:10:04,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:10:04,463 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1852809946, now seen corresponding path program 1 times [2020-08-22 22:10:04,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:04,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [993945742] [2020-08-22 22:10:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:10:04,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [993945742] [2020-08-22 22:10:04,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:10:04,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 22:10:04,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566762673] [2020-08-22 22:10:04,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 22:10:04,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 22:10:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 22:10:04,603 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2020-08-22 22:10:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:04,794 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-08-22 22:10:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 22:10:04,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-08-22 22:10:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:04,797 INFO L225 Difference]: With dead ends: 45 [2020-08-22 22:10:04,797 INFO L226 Difference]: Without dead ends: 39 [2020-08-22 22:10:04,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 22:10:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-22 22:10:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-08-22 22:10:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 22:10:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-08-22 22:10:04,812 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2020-08-22 22:10:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:04,813 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-08-22 22:10:04,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 22:10:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-08-22 22:10:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-08-22 22:10:04,814 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:04,815 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-08-22 22:10:04,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:10:04,815 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -238705980, now seen corresponding path program 1 times [2020-08-22 22:10:04,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:04,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497087230] [2020-08-22 22:10:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-22 22:10:04,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497087230] [2020-08-22 22:10:04,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:04,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 22:10:04,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065985352] [2020-08-22 22:10:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 22:10:04,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 22:10:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 22:10:04,988 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2020-08-22 22:10:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:05,108 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-08-22 22:10:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 22:10:05,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-08-22 22:10:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:05,111 INFO L225 Difference]: With dead ends: 55 [2020-08-22 22:10:05,111 INFO L226 Difference]: Without dead ends: 49 [2020-08-22 22:10:05,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:10:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-08-22 22:10:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-08-22 22:10:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 22:10:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-08-22 22:10:05,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2020-08-22 22:10:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:05,127 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-08-22 22:10:05,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 22:10:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-08-22 22:10:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 22:10:05,129 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:05,129 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-08-22 22:10:05,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:10:05,130 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2006293766, now seen corresponding path program 1 times [2020-08-22 22:10:05,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:05,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493137448] [2020-08-22 22:10:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 22:10:05,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493137448] [2020-08-22 22:10:05,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:05,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 22:10:05,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232303979] [2020-08-22 22:10:05,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 22:10:05,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 22:10:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-08-22 22:10:05,319 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 9 states. [2020-08-22 22:10:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:05,438 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-08-22 22:10:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 22:10:05,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-08-22 22:10:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:05,440 INFO L225 Difference]: With dead ends: 65 [2020-08-22 22:10:05,440 INFO L226 Difference]: Without dead ends: 59 [2020-08-22 22:10:05,441 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-08-22 22:10:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-08-22 22:10:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-08-22 22:10:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-08-22 22:10:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-08-22 22:10:05,455 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2020-08-22 22:10:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:05,456 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-08-22 22:10:05,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 22:10:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-08-22 22:10:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-08-22 22:10:05,458 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:05,458 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-08-22 22:10:05,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:10:05,458 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 940355172, now seen corresponding path program 2 times [2020-08-22 22:10:05,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:05,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930526666] [2020-08-22 22:10:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-08-22 22:10:05,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930526666] [2020-08-22 22:10:05,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:05,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 22:10:05,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239948250] [2020-08-22 22:10:05,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:10:05,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:05,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:10:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:10:05,663 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-08-22 22:10:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:05,807 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-08-22 22:10:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 22:10:05,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-08-22 22:10:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:05,811 INFO L225 Difference]: With dead ends: 75 [2020-08-22 22:10:05,811 INFO L226 Difference]: Without dead ends: 69 [2020-08-22 22:10:05,814 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-08-22 22:10:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-22 22:10:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-08-22 22:10:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-22 22:10:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-08-22 22:10:05,839 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2020-08-22 22:10:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:05,839 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-08-22 22:10:05,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:10:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-08-22 22:10:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 22:10:05,844 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:05,844 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-08-22 22:10:05,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:10:05,845 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash 826985242, now seen corresponding path program 2 times [2020-08-22 22:10:05,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:05,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1564058760] [2020-08-22 22:10:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:05,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 22:10:06,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1564058760] [2020-08-22 22:10:06,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:06,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 22:10:06,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192250642] [2020-08-22 22:10:06,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 22:10:06,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 22:10:06,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-22 22:10:06,258 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 15 states. [2020-08-22 22:10:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:06,508 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-08-22 22:10:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 22:10:06,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-08-22 22:10:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:06,511 INFO L225 Difference]: With dead ends: 85 [2020-08-22 22:10:06,511 INFO L226 Difference]: Without dead ends: 79 [2020-08-22 22:10:06,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-08-22 22:10:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-08-22 22:10:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2020-08-22 22:10:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-22 22:10:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-08-22 22:10:06,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 56 [2020-08-22 22:10:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:06,528 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-08-22 22:10:06,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 22:10:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-08-22 22:10:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-08-22 22:10:06,530 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:06,530 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-08-22 22:10:06,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:10:06,530 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash -996081148, now seen corresponding path program 3 times [2020-08-22 22:10:06,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:06,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17458464] [2020-08-22 22:10:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 22:10:06,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17458464] [2020-08-22 22:10:06,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:06,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 22:10:06,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325426280] [2020-08-22 22:10:06,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 22:10:06,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 22:10:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-08-22 22:10:06,797 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 12 states. [2020-08-22 22:10:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:07,086 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2020-08-22 22:10:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 22:10:07,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-08-22 22:10:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:07,089 INFO L225 Difference]: With dead ends: 156 [2020-08-22 22:10:07,089 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 22:10:07,090 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-08-22 22:10:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 22:10:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2020-08-22 22:10:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-08-22 22:10:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-08-22 22:10:07,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 64 [2020-08-22 22:10:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:07,107 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-08-22 22:10:07,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 22:10:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-08-22 22:10:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-08-22 22:10:07,108 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:10:07,108 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-08-22 22:10:07,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:10:07,109 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:10:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:10:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1686185158, now seen corresponding path program 3 times [2020-08-22 22:10:07,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:10:07,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732596590] [2020-08-22 22:10:07,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:10:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:10:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 22:10:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 22:10:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:10:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-08-22 22:10:07,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [732596590] [2020-08-22 22:10:07,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:10:07,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 22:10:07,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124346970] [2020-08-22 22:10:07,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 22:10:07,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:10:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 22:10:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-08-22 22:10:07,369 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 13 states. [2020-08-22 22:10:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:10:07,618 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-08-22 22:10:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:10:07,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2020-08-22 22:10:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:10:07,619 INFO L225 Difference]: With dead ends: 101 [2020-08-22 22:10:07,619 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:10:07,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2020-08-22 22:10:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:10:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:10:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:10:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:10:07,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2020-08-22 22:10:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:10:07,622 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:10:07,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 22:10:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:10:07,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:10:07,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:10:07,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:10:08,364 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-08-22 22:10:08,633 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2020-08-22 22:10:08,890 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2020-08-22 22:10:09,095 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2020-08-22 22:10:09,228 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-08-22 22:10:09,506 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2020-08-22 22:10:09,814 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2020-08-22 22:10:10,078 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-08-22 22:10:10,303 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-08-22 22:10:10,314 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,314 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,314 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-08-22 22:10:10,315 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-08-22 22:10:10,315 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-08-22 22:10:10,315 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-08-22 22:10:10,315 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-08-22 22:10:10,315 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-08-22 22:10:10,316 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-08-22 22:10:10,316 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2020-08-22 22:10:10,316 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-08-22 22:10:10,316 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,317 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:10:10,317 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: false [2020-08-22 22:10:10,317 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 17 23) the Hoare annotation is: true [2020-08-22 22:10:10,317 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-08-22 22:10:10,318 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: false [2020-08-22 22:10:10,318 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-08-22 22:10:10,318 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-08-22 22:10:10,318 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-08-22 22:10:10,318 INFO L264 CegarLoopResult]: At program point L20-2(lines 17 23) the Hoare annotation is: (<= 5 main_~input~0) [2020-08-22 22:10:10,318 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-08-22 22:10:10,318 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-08-22 22:10:10,319 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-08-22 22:10:10,319 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-08-22 22:10:10,319 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-08-22 22:10:10,319 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-08-22 22:10:10,319 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-08-22 22:10:10,320 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2020-08-22 22:10:10,320 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-08-22 22:10:10,320 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-08-22 22:10:10,320 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-08-22 22:10:10,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:10:10 BoogieIcfgContainer [2020-08-22 22:10:10,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:10:10,346 INFO L168 Benchmark]: Toolchain (without parser) took 7022.38 ms. Allocated memory was 138.9 MB in the beginning and 310.4 MB in the end (delta: 171.4 MB). Free memory was 102.3 MB in the beginning and 167.5 MB in the end (delta: -65.2 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,346 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 119.8 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.76 ms. Allocated memory is still 138.9 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,348 INFO L168 Benchmark]: Boogie Preprocessor took 112.35 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 181.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,349 INFO L168 Benchmark]: RCFGBuilder took 259.18 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 169.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,350 INFO L168 Benchmark]: TraceAbstraction took 6424.75 ms. Allocated memory was 202.4 MB in the beginning and 310.4 MB in the end (delta: 108.0 MB). Free memory was 168.1 MB in the beginning and 167.5 MB in the end (delta: 605.1 kB). Peak memory consumption was 155.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:10:10,354 INFO L336 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 138.9 MB. Free memory was 120.3 MB in the beginning and 119.8 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 220.76 ms. Allocated memory is still 138.9 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.35 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 181.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 259.18 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 169.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6424.75 ms. Allocated memory was 202.4 MB in the beginning and 310.4 MB in the end (delta: 108.0 MB). Free memory was 168.1 MB in the beginning and 167.5 MB in the end (delta: 605.1 kB). Peak memory consumption was 155.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: 3.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 194 SDslu, 1616 SDs, 0 SdLazy, 823 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s 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, 0.5s HoareSimplificationTime, 34 FomulaSimplificationsInter, 3069 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 47966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 165/224 InterpolantCoveringCapability, 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...