/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/sum_10x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:30:44,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:30:44,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:30:44,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:30:44,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:30:44,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:30:44,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:30:44,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:30:44,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:30:44,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:30:44,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:30:44,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:30:44,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:30:44,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:30:44,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:30:44,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:30:44,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:30:44,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:30:44,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:30:44,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:30:44,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:30:44,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:30:44,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:30:44,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:30:44,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:30:44,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:30:44,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:30:44,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:30:44,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:30:44,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:30:44,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:30:44,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:30:44,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:30:44,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:30:44,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:30:44,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:30:44,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:30:44,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:30:44,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:30:44,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:30:44,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:30:44,967 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:30:44,981 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:30:44,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:30:44,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:30:44,983 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:30:44,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:30:44,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:30:44,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:30:44,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:30:44,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:30:44,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:30:44,985 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:30:44,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:30:44,985 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:30:44,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:30:44,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:30:44,986 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:30:44,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:30:44,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:30:44,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:30:44,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:30:44,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:30:44,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:30:44,987 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:30:45,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:30:45,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:30:45,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:30:45,478 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:30:45,479 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:30:45,480 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-09-04 16:30:45,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dd650f8ae/da54f8a382644d7ea7aaf4c89c58ec30/FLAG9e159f8bc [2020-09-04 16:30:46,217 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:30:46,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-09-04 16:30:46,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dd650f8ae/da54f8a382644d7ea7aaf4c89c58ec30/FLAG9e159f8bc [2020-09-04 16:30:46,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dd650f8ae/da54f8a382644d7ea7aaf4c89c58ec30 [2020-09-04 16:30:46,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:30:46,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:30:46,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:46,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:30:46,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:30:46,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4c149c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46, skipping insertion in model container [2020-09-04 16:30:46,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:30:46,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:30:46,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:46,856 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:30:46,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:46,897 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:30:46,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46 WrapperNode [2020-09-04 16:30:46,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:46,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:30:46,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:30:46,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:30:46,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (1/1) ... [2020-09-04 16:30:46,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:30:46,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:30:46,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:30:46,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:30:46,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (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:30:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:30:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:30:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:30:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:30:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:30:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:30:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:30:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:30:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:30:47,366 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:30:47,366 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:30:47,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:47 BoogieIcfgContainer [2020-09-04 16:30:47,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:30:47,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:30:47,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:30:47,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:30:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:30:46" (1/3) ... [2020-09-04 16:30:47,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:47, skipping insertion in model container [2020-09-04 16:30:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:46" (2/3) ... [2020-09-04 16:30:47,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:47, skipping insertion in model container [2020-09-04 16:30:47,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:47" (3/3) ... [2020-09-04 16:30:47,385 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2020-09-04 16:30:47,399 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:30:47,412 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:30:47,480 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:30:47,540 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:30:47,541 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:30:47,541 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:30:47,541 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:30:47,541 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:30:47,541 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:30:47,541 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:30:47,541 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:30:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:30:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:30:47,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:47,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:47,589 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:47,597 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:30:47,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:47,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608566383] [2020-09-04 16:30:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:47,688 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,886 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:30:47,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608566383] [2020-09-04 16:30:47,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:47,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:30:47,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345584284] [2020-09-04 16:30:47,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:30:47,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:30:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:30:47,926 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:30:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:48,040 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:30:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:30:48,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:30:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:48,058 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:30:48,059 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:30:48,065 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:30:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:30:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:30:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:30:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:30:48,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:30:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:48,139 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:30:48,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:30:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:30:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:30:48,143 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:48,143 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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:30:48,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:30:48,144 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:48,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:30:48,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:48,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054585674] [2020-09-04 16:30:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:48,149 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 16:30:48,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054585674] [2020-09-04 16:30:48,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:48,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:30:48,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408084616] [2020-09-04 16:30:48,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:30:48,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:30:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:30:48,313 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:30:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:48,407 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:30:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:30:48,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:30:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:48,409 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:30:48,410 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:30:48,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:30:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:30:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:30:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:30:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:30:48,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:30:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:48,426 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:30:48,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:30:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:30:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:30:48,428 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:48,428 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:48,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:30:48,429 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:30:48,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:48,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761107088] [2020-09-04 16:30:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:48,433 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,620 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:30:48,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761107088] [2020-09-04 16:30:48,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:48,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:30:48,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694986092] [2020-09-04 16:30:48,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:30:48,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:30:48,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:30:48,624 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:30:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:48,716 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:30:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:30:48,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:30:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:48,719 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:30:48,719 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:30:48,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:30:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:30:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:30:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:30:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:30:48,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:30:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:48,734 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:30:48,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:30:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:30:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:30:48,736 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:48,736 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:48,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:30:48,737 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:30:48,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:48,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [146925091] [2020-09-04 16:30:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:48,741 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:48,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:30:49,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [146925091] [2020-09-04 16:30:49,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:49,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:30:49,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069553900] [2020-09-04 16:30:49,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:30:49,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:30:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:30:49,026 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:30:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:49,145 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:30:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:30:49,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:30:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:49,147 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:30:49,147 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:30:49,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:30:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:30:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:30:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:30:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:30:49,160 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:30:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:49,160 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:30:49,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:30:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:30:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:30:49,163 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:49,163 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:49,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:30:49,163 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:30:49,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:49,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572985973] [2020-09-04 16:30:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:49,169 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-09-04 16:30:49,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572985973] [2020-09-04 16:30:49,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:49,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:30:49,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289683902] [2020-09-04 16:30:49,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:30:49,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:30:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:30:49,449 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:30:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:49,547 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:30:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:30:49,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:30:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:49,550 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:30:49,550 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:30:49,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:30:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:30:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:30:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:30:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:30:49,562 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:30:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:49,564 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:30:49,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:30:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:30:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:30:49,566 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:49,566 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:49,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:30:49,566 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:30:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:49,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45121577] [2020-09-04 16:30:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:49,573 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 16:30:49,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45121577] [2020-09-04 16:30:49,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:49,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:30:49,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064923155] [2020-09-04 16:30:49,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:30:49,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:30:49,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:30:49,847 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:30:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:49,953 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:30:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:30:49,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:30:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:49,955 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:30:49,956 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:30:49,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:30:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:30:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:30:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:30:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:30:49,969 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:30:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:49,969 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:30:49,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:30:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:30:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:30:49,971 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:49,972 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:49,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:30:49,972 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:30:49,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:49,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568759465] [2020-09-04 16:30:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:49,976 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-09-04 16:30:50,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568759465] [2020-09-04 16:30:50,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:50,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:30:50,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551210477] [2020-09-04 16:30:50,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:30:50,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:50,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:30:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:30:50,271 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:30:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:50,397 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:30:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:30:50,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:30:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:50,399 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:30:50,399 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:30:50,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:30:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:30:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:30:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:30:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:30:50,411 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:30:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:50,412 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:30:50,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:30:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:30:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:30:50,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:50,414 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:50,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:30:50,414 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:30:50,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:50,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047953331] [2020-09-04 16:30:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:50,417 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-09-04 16:30:50,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047953331] [2020-09-04 16:30:50,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:50,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:30:50,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294383969] [2020-09-04 16:30:50,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:30:50,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:30:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:30:50,767 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:30:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:50,915 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:30:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:30:50,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:30:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:50,918 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:30:50,918 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:30:50,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:30:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:30:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:30:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:30:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:30:50,929 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:30:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:50,930 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:30:50,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:30:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:30:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:30:50,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:50,932 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:50,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:30:50,933 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:30:50,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:50,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [755964859] [2020-09-04 16:30:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:50,935 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 16:30:51,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [755964859] [2020-09-04 16:30:51,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:51,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:30:51,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692950062] [2020-09-04 16:30:51,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:30:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:30:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:30:51,323 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:30:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:51,504 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:30:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:30:51,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:30:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:51,508 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:30:51,508 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:30:51,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:30:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:30:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:30:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:30:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:30:51,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:30:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:51,528 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:30:51,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:30:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:30:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:30:51,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:51,534 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:51,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:30:51,536 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:30:51,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:51,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62228615] [2020-09-04 16:30:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:51,539 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-09-04 16:30:52,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62228615] [2020-09-04 16:30:52,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:52,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:30:52,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370626571] [2020-09-04 16:30:52,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:30:52,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:30:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:30:52,007 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:30:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:52,174 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:30:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:30:52,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:30:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:52,177 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:30:52,177 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:30:52,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:30:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:30:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:30:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:30:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:30:52,196 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:30:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:52,198 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:30:52,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:30:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:30:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:30:52,199 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:52,200 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:52,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:30:52,200 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:30:52,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:52,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779030391] [2020-09-04 16:30:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:52,207 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:52,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:30:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2020-09-04 16:30:53,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [779030391] [2020-09-04 16:30:53,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:53,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-09-04 16:30:53,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952014340] [2020-09-04 16:30:53,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-09-04 16:30:53,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-09-04 16:30:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:30:53,769 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 30 states. [2020-09-04 16:30:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:55,750 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-09-04 16:30:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-04 16:30:55,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2020-09-04 16:30:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:55,753 INFO L225 Difference]: With dead ends: 70 [2020-09-04 16:30:55,753 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:30:55,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=788, Invalid=3244, Unknown=0, NotChecked=0, Total=4032 [2020-09-04 16:30:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:30:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:30:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:30:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:30:55,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2020-09-04 16:30:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:55,761 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:30:55,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-09-04 16:30:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:30:55,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:30:55,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:30:55,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:30:56,544 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-09-04 16:30:57,058 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-09-04 16:30:57,488 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2020-09-04 16:30:57,966 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-09-04 16:30:58,409 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-09-04 16:30:58,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,448 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,449 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,449 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,449 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:30:58,449 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#in~n| 1) .cse0 .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse0 .cse1) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 8) .cse0 .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-09-04 16:30:58,450 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-09-04 16:30:58,450 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (let ((.cse0 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) (.cse1 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= |sum_#in~n| 4) .cse1 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|)) (and (<= |sum_#in~n| 5) (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) .cse0 (<= |sum_#in~n| 7) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret0|)) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse0 .cse1 (<= |sum_#in~n| 3)) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 1) .cse1 (<= (+ |sum_#in~m| 1) |sum_#t~ret0|)) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse0 (<= |sum_#in~n| 8) .cse1))) (let ((.cse2 (= sum_~n |sum_#in~n|))) (or (and .cse2 (<= |sum_#in~n| 9)) (and .cse2 (<= (+ |sum_#in~m| 10) |sum_#t~ret0|))))) [2020-09-04 16:30:58,450 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-09-04 16:30:58,451 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (and (let ((.cse0 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) (.cse1 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= |sum_#in~n| 4) .cse1 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|)) (and (<= |sum_#in~n| 5) (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) .cse0 (<= |sum_#in~n| 7) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret0|)) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse0 .cse1 (<= |sum_#in~n| 3)) (and .cse0 (<= |sum_#in~n| 2) .cse1 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 1) .cse1 (<= (+ |sum_#in~m| 1) |sum_#t~ret0|)) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse0 (<= |sum_#in~n| 8) .cse1))) (let ((.cse2 (= sum_~n |sum_#in~n|))) (or (and .cse2 (<= |sum_#in~n| 9)) (and .cse2 (<= (+ |sum_#in~m| 10) |sum_#t~ret0|))))) [2020-09-04 16:30:58,451 INFO L264 CegarLoopResult]: At program point L4(lines 4 8) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-09-04 16:30:58,451 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse14 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#t~ret0| .cse14)) (.cse3 (= sum_~m |sum_#in~m|)) (.cse4 (<= |sum_#res| .cse14))) (or (let ((.cse1 (+ |sum_#in~m| 7))) (and .cse0 (<= .cse1 |sum_#t~ret0|) .cse2 (<= .cse1 |sum_#res|) (<= |sum_#in~n| 7) .cse3 .cse4)) (let ((.cse5 (+ |sum_#in~m| 1))) (and .cse0 (<= .cse5 |sum_#res|) .cse2 (<= |sum_#in~n| 1) .cse3 .cse4 (<= .cse5 |sum_#t~ret0|))) (let ((.cse6 (+ |sum_#in~m| 9))) (and .cse0 .cse2 .cse3 .cse4 (<= .cse6 |sum_#res|) (<= |sum_#in~n| 9) (<= .cse6 |sum_#t~ret0|))) (let ((.cse7 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse7 |sum_#res|) .cse2 .cse3 (<= .cse7 |sum_#t~ret0|) .cse4)) (let ((.cse8 (+ |sum_#in~m| 3))) (and .cse0 (<= .cse8 |sum_#t~ret0|) .cse2 .cse3 .cse4 (<= |sum_#in~n| 3) (<= .cse8 |sum_#res|))) (let ((.cse9 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) (<= .cse9 |sum_#t~ret0|) .cse2 .cse3 .cse4 (<= .cse9 |sum_#res|))) (let ((.cse10 (+ |sum_#in~m| 2))) (and .cse0 .cse2 (<= .cse10 |sum_#res|) (<= |sum_#in~n| 2) .cse3 .cse4 (<= .cse10 |sum_#t~ret0|))) (let ((.cse11 (+ |sum_#in~m| 8))) (and .cse0 (<= .cse11 |sum_#t~ret0|) .cse2 (<= |sum_#in~n| 8) .cse3 .cse4 (<= .cse11 |sum_#res|))) (let ((.cse12 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse12 |sum_#res|) .cse2 .cse3 .cse4 (<= |sum_#in~n| 6) (<= .cse12 |sum_#t~ret0|))) (let ((.cse13 (+ |sum_#in~m| 4))) (and .cse0 .cse2 (<= |sum_#in~n| 4) .cse3 .cse4 (<= .cse13 |sum_#res|) (<= .cse13 |sum_#t~ret0|)))))) [2020-09-04 16:30:58,452 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-09-04 16:30:58,452 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#in~n| 1) .cse0 .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and .cse0 .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse0 .cse1) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 8) .cse0 .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-09-04 16:30:58,452 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-09-04 16:30:58,453 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-09-04 16:30:58,453 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-09-04 16:30:58,453 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 10 main_~a~0) [2020-09-04 16:30:58,453 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-09-04 16:30:58,453 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~result~0) (<= main_~a~0 10) (<= 10 main_~a~0) (<= main_~result~0 .cse0))) [2020-09-04 16:30:58,453 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0)) [2020-09-04 16:30:58,454 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0)) [2020-09-04 16:30:58,454 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 10) (<= 10 main_~a~0) (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|))) [2020-09-04 16:30:58,454 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 10 main_~a~0) [2020-09-04 16:30:58,454 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~a~0 10) (<= 10 main_~a~0) (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|))) [2020-09-04 16:30:58,454 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~result~0) (<= main_~a~0 10) (<= 10 main_~a~0) (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~result~0 .cse0))) [2020-09-04 16:30:58,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:30:58 BoogieIcfgContainer [2020-09-04 16:30:58,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:30:58,489 INFO L168 Benchmark]: Toolchain (without parser) took 11904.51 ms. Allocated memory was 136.8 MB in the beginning and 378.0 MB in the end (delta: 241.2 MB). Free memory was 101.4 MB in the beginning and 214.7 MB in the end (delta: -113.2 MB). Peak memory consumption was 220.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:58,490 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:30:58,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.30 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.9 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:30:58,491 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 136.8 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:58,492 INFO L168 Benchmark]: RCFGBuilder took 442.90 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.6 MB in the beginning and 167.2 MB in the end (delta: -76.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:58,493 INFO L168 Benchmark]: TraceAbstraction took 11112.20 ms. Allocated memory was 200.3 MB in the beginning and 378.0 MB in the end (delta: 177.7 MB). Free memory was 167.2 MB in the beginning and 214.7 MB in the end (delta: -47.5 MB). Peak memory consumption was 223.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:58,498 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.29 ms. Allocated memory is still 136.8 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.30 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 91.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 136.8 MB. Free memory was 91.9 MB in the beginning and 90.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 442.90 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 90.6 MB in the beginning and 167.2 MB in the end (delta: -76.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11112.20 ms. Allocated memory was 200.3 MB in the beginning and 378.0 MB in the end (delta: 177.7 MB). Free memory was 167.2 MB in the beginning and 214.7 MB in the end (delta: -47.5 MB). Peak memory consumption was 223.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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: 3]: Procedure Contract for sum Derived contract for procedure sum: ((((((((((((\old(m) + 1 <= \result && \old(n) <= 1) && m == \old(m)) && \result <= \old(n) + \old(m)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || ((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 3) && \old(m) + 3 <= \result)) || (((\old(m) + 7 <= \result && \old(n) <= 7) && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(n) <= 8 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) && ((n == \old(n) && \old(n) <= 9) || (n == \old(n) && \old(m) + 10 <= \result)) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 10 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 215 SDtfs, 343 SDslu, 960 SDs, 0 SdLazy, 818 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=10, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 187 NumberOfFragments, 1136 HoareAnnotationTreeSize, 37 FomulaSimplifications, 1040 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 27 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 2.3s 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...